Encoder, decoder, encoding method, and decoding method

ABSTRACT

An encoder according to one aspect of the present disclosure encodes a block of an image, and includes a processor and memory connected to the processor. Using the memory, the processor partitions a block into a plurality of sub blocks and encodes a sub block included in the plurality of sub blocks in an encoding process including at least a transform process or a prediction process. The block is partitioned using a multiple partition including at least three odd-numbered child nodes and each of a width and a height of each of the plurality of sub blocks is a power of two.

BACKGROUND Technical Field

This disclosure relates to video coding, and particularly to videoencoding and decoding systems, components, and methods for performingblock partitioning related to a prediction process, a transform processor an inverse transform function.

Description of the Related Art

With advancement in video coding technology, from H.261 and MPEG-1 toH.264/AVC (Advanced Video Coding), MPEG-LA, H.265/HEVC (High EfficiencyVideo Coding) and H.266/VVC (Versatile Video Codec), there remains aconstant need to provide improvements and optimizations to the videocoding technology to process an ever-increasing amount of digital videodata in various applications. This disclosure relates to furtheradvancements, improvements and optimizations in video coding,particularly in block partitioning related to a prediction process, atransform process or an inverse transform process.

BRIEF SUMMARY

An encoder according to one aspect of the present disclosure encodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor partitions a block into aplurality of sub blocks and encodes a sub block included in theplurality of sub blocks in an encoding process including at least atransform process or a prediction process. The block is partitionedusing a multiple partition including at least three odd-numbered childnodes and each of a width and a height of each of the plurality of subblocks is a power of two.

A decoder according to one aspect of the present disclosure decodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor partitions a block into aplurality of sub blocks and decodes a sub block included in theplurality of sub blocks in a decoding process including at least aninverse transform process or a prediction process. The block ispartitioned using a multiple partition including at least threeodd-numbered child nodes, and each of a width and a height of each ofthe plurality of sub blocks is a power of two.

An encoding method according to one aspect of the present disclosure ofencoding a block of an image includes partitioning a block into aplurality of sub blocks and encoding a sub block included in theplurality of sub blocks in an encoding process including at least atransform process or a prediction process. The block is partitionedusing a multiple partition including at least three odd-numbered childnodes and each of a width and a height of each of the plurality of subblocks is a power of two.

A decoding method according to one aspect of the present disclosure ofdecoding a block of an image includes partitioning a block into aplurality of sub blocks and decoding a sub block included in theplurality of sub blocks in a decoding process including at least aninverse transform process or a prediction process. The block ispartitioned using a multiple partition including at least threeodd-numbered child nodes and each of a width and a height of each of theplurality of sub blocks is a power of two.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

The present disclosure can provide an encoder, a decoder, an encodingmethod, and a decoding method capable of realizing a further improvedcompression efficiency and a further reduced processing load.

Some implementations of embodiments of the present disclosure mayimprove an encoding efficiency, may simply be an encoding/decodingprocess, may accelerate an encoding/decoding process speed, mayefficiently select appropriate components/operations used in encodingand decoding such as appropriate filter, block size, motion vector,reference picture, reference block, etc.

Additional benefits and advantages of the disclosed embodiments willbecome apparent from the specification and drawings. The benefits and/oradvantages may be individually obtained by the various embodiments andfeatures of the specification and drawings, not all of which need to beprovided in order to obtain one or more of such benefits and/oradvantages.

It should be noted that general or specific embodiments may beimplemented as a system, a method, an integrated circuit, a computerprogram, a storage medium, or any selective combination thereof.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

In the drawings, identical reference numbers identify similar elements.The sizes and relative positions of elements in the drawings are notnecessarily drawn to scale.

FIG. 1 is a block diagram illustrating a functional configuration of anencoder according to an embodiment.

FIG. 2 illustrates one example of block splitting.

FIG. 3 is a table indicating transform basis functions of varioustransform types.

FIG. 4A illustrates one example of a filter shape used in ALF (adaptiveloop filter).

FIG. 4B illustrates another example of a filter shape used in ALF.

FIG. 4C illustrates another example of a filter shape used in ALF.

FIG. 5A illustrates 67 intra prediction modes used in an example ofintra prediction.

FIG. 5B is a flow chart illustrating one example of a prediction imagecorrection process performed in OBMC (overlapped block motioncompensation) processing.

FIG. 5C is a conceptual diagram illustrating one example of a predictionimage correction process performed in OBMC processing.

FIG. 5D is a flow chart illustrating one example of FRUC (frame rate upconversion) processing.

FIG. 6 illustrates one example of pattern matching (bilateral matching)between two blocks along a motion trajectory.

FIG. 7 illustrates one example of pattern matching (template matching)between a template in the current picture and a block in a referencepicture.

FIG. 8 illustrates a model that assumes uniform linear motion.

FIG. 9A illustrates one example of deriving a motion vector of eachsub-block based on motion vectors of neighboring blocks.

FIG. 9B illustrates one example of a process for deriving a motionvector in merge mode.

FIG. 9C is a conceptual diagram illustrating an example of DMVR (dynamicmotion vector refreshing) processing.

FIG. 9D illustrates one example of a prediction image generation methodusing a luminance correction process performed by LIC (localillumination compensation) processing.

FIG. 10 is a block diagram illustrating a functional configuration ofthe decoder according to an embodiment.

FIG. 11 is a flow chart of one example of a video encoding processaccording to Embodiment 1.

FIG. 12 is a flow chart of one example of a video decoding processaccording to Embodiment 1.

FIG. 13 is a flow chart of one example of a video encoding processaccording to Embodiment 2.

FIG. 14 is a flow chart of one example of a video decoding processaccording to Embodiment 2.

FIG. 15 is a flow chart of one example of a video encoding processaccording to Embodiment 3.

FIG. 16 is a flow chart of one example of a video decoding processaccording to Embodiment 3.

FIG. 17 is a flow chart of one example of a video encoding processaccording to Embodiment 4.

FIG. 18 is a flow chart of one example of a video decoding processaccording to Embodiment 4.

FIG. 19 is a flow chart of one example of a video encoding processaccording to Embodiment 5.

FIG. 20 is a flow chart of one example of a video decoding processaccording to Embodiment 5.

FIG. 21 is a flow chart of one example of a video encoding processaccording to Embodiment 6.

FIG. 22 is a flow chart of one example of a video decoding processaccording to Embodiment 6.

FIG. 23 is a flow chart of one example of a video encoding processaccording to Embodiment 7.

FIG. 24 is a flow chart of one example of a video decoding processaccording to Embodiment 7.

FIG. 25 is a flow chart of one example of a video encoding processaccording to Embodiment 8.

FIG. 26 is a flow chart of one example of a video decoding processaccording to Embodiment 8.

FIG. 27 is a flow chart of one example of a video encoding processaccording to Embodiment 9.

FIG. 28 is a flow chart of one example of a video decoding processaccording to Embodiment 9.

FIG. 29 is a flow chart of one example of a video encoding processaccording to Embodiment 10.

FIG. 30 is a flow chart of one example of a video decoding processaccording to Embodiment 10.

FIG. 31 is a flow chart of one example of a video encoding processaccording to Embodiment 11.

FIG. 32 is a flow chart of one example of a video decoding processaccording to Embodiment 11.

FIG. 33 is a flow chart of one example of a video encoding processaccording to Embodiment 12.

FIG. 34 is a flow chart of one example of a video decoding processaccording to Embodiment 12.

FIG. 35 is a block diagram illustrating a structure of a video/imageencoder according to an embodiment.

FIG. 36 is a block diagram illustrating a structure of a video/imagedecoder according to an embodiment.

FIG. 37 illustrates possible locations of the parameters in a compressedvideo bitstream.

FIG. 38 illustrates different block partitions depending on blockpartitioning information.

FIG. 39 illustrates one example of combinations of block partitionstructures.

FIG. 40 illustrates one example of block partition structuremodification.

FIG. 41 illustrates examples of partitioning methods and block partitionstructure modification.

FIG. 42A illustrates one example of initialized block partitionstructure modification.

FIG. 42B illustrates one example of initialized block partitionstructure modification.

FIG. 42C illustrates one example of initialized block partitionstructure modification.

FIG. 43 illustrates one example of initialized block partition structuremodification.

FIG. 44 illustrates different block partitions depending on geometry.

FIG. 45A illustrates an example of partitioning blocks into sub blocksof different geometries based on different block geometries.

FIG. 45B illustrates an example of partitioning blocks into sub blocksof different geometries based on different block geometries.

FIG. 45C illustrates an example of partitioning blocks into sub blocksof different geometries based on different block geometries.

FIG. 45D illustrates an example of partitioning blocks into sub blocksof different geometries based on different block geometries.

FIG. 46A illustrates an example of partitioning blocks into sub blocksof different geometries based on different parameters.

FIG. 46B illustrates an example of partitioning blocks into sub blocksof different geometries based on different parameters.

FIG. 46C illustrates an example of partitioning blocks into sub blocksof different geometries based on different parameters.

FIG. 46D illustrates an example of partitioning blocks into sub blocksof different geometries based on different parameters.

FIG. 47A illustrates an example of partitioning blocks into a differentnumber of sub blocks based on different block geometries.

FIG. 47B illustrates an example of partitioning blocks into a differentnumber of sub blocks based on different block geometries.

FIG. 48A illustrates an example of partitioning blocks into a differentnumber of sub blocks based on different parameters.

FIG. 48B illustrates an example of partitioning blocks into a differentnumber of sub blocks based on different parameters.

FIG. 48C illustrates an example of partitioning blocks into a differentnumber of sub blocks based on different parameters.

FIG. 49A illustrates an example of selecting block partitioninginformation from a set of block partitioning information.

FIG. 49B illustrates an example of selecting block partitioninginformation from a set of block partitioning information.

FIG. 50 illustrates an example of selecting block partition structurebased on predicted block partition structure.

FIG. 51 illustrates an example of reordering a block partitioninginformation list.

FIG. 52 illustrates an example of reordering a block partitioninginformation list.

FIG. 53 illustrates the coding bits and meaning of partition selectionparameters.

FIG. 54 illustrates an overall configuration of a content providingsystem for implementing a content distribution service.

FIG. 55 illustrates one example of an encoding structure in scalableencoding.

FIG. 56 illustrates one example of an encoding structure in scalableencoding.

FIG. 57 illustrates an example of a display screen of a web page.

FIG. 58 illustrates an example of a display screen of a web page.

FIG. 59 illustrates one example of a smartphone.

FIG. 60 is a block diagram illustrating a configuration example of asmartphone.

DETAILED DESCRIPTION

Hereinafter, embodiment(s) will be described with reference to thedrawings. Note that the embodiment(s) described below each show ageneral or specific example. The numerical values, shapes, materials,components, the arrangement and connection of the components, steps, therelation and order of the steps, etc., indicated in the followingembodiment(s) are mere examples, and are not intended to limit the scopeof the claims. Therefore, those components disclosed in the followingembodiment(s) but not recited in any of the independent claims definingthe broadest inventive concepts may be understood as optionalcomponents.

Embodiments of an encoder and a decoder will be described below. Theembodiments are examples of an encoder and a decoder to which theprocesses and/or configurations presented in the description of aspectsof the present disclosure are applicable. The processes and/orconfigurations can also be implemented in an encoder and a decoderdifferent from those according to the embodiments. For example,regarding the processes and/or configurations as applied to theembodiments, any of the following may be implemented:

(1) Any of the components of the encoder or the decoder according to theembodiments presented in the description of aspects of the presentdisclosure may be substituted or combined with another componentpresented anywhere in the description of aspects of the presentdisclosure.

(2) In the encoder or the decoder according to the embodiments,discretionary changes may be made to functions or processes performed byone or more components of the encoder or the decoder, such as addition,substitution, removal, etc., of the functions or processes. For example,any function or process may be substituted or combined with anotherfunction or process presented anywhere in the description of aspects ofthe present disclosure.

(3) In the method implemented by the encoder or the decoder according tothe embodiments, discretionary changes may be made such as addition,substitution, and removal of one or more of the processes included inthe method. For example, any process in the method may be substituted orcombined with another process presented anywhere in the description ofaspects of the present disclosure.

(4) One or more components included in the encoder or the decoderaccording to embodiments may be combined with a component presentedanywhere in the description of aspects of the present disclosure, may becombined with a component including one or more functions presentedanywhere in the description of aspects of the present disclosure, andmay be combined with a component that implements one or more processesimplemented by a component presented in the description of aspects ofthe present disclosure.

(5) A component including one or more functions of the encoder or thedecoder according to the embodiments, or a component that implements oneor more processes of the encoder or the decoder according to theembodiments, may be combined or substituted with a component presentedanywhere in the description of aspects of the present disclosure, with acomponent including one or more functions presented anywhere in thedescription of aspects of the present disclosure, or with a componentthat implements one or more processes presented anywhere in thedescription of aspects of the present disclosure.

(6) In the method implemented by the encoder or the decoder according tothe embodiments, any of the processes included in the method may besubstituted or combined with a process presented anywhere in thedescription of aspects of the present disclosure or with anycorresponding or equivalent process.

(7) One or more processes included in the method implemented by theencoder or the decoder according to the embodiments may be combined witha process presented anywhere in the description of aspects of thepresent disclosure.

(8) The implementation of the processes and/or configurations presentedin the description of aspects of the present disclosure is not limitedto the encoder or the decoder according to the embodiments. For example,the processes and/or configurations may be implemented in a device usedfor a purpose different from the moving picture encoder or the movingpicture decoder disclosed in the embodiments.

Encoder

First, the encoder according to an embodiment will be described. FIG. 1is a block diagram illustrating a functional configuration of encoder100 according to the embodiment. Encoder 100 is a moving picture encoderthat encodes a moving picture block by block.

As illustrated in FIG. 1, encoder 100 is a device that encodes a pictureblock by block, and includes splitter 102, subtractor 104, transformer106, quantizer 108, entropy encoder 110, inverse quantizer 112, inversetransformer 114, adder 116, block memory 118, loop filter 120, framememory 122, intra predictor 124, inter predictor 126, and predictioncontroller 128.

Encoder 100 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as splitter 102, subtractor104, transformer 106, quantizer 108, entropy encoder 110, inversequantizer 112, inverse transformer 114, adder 116, loop filter 120,intra predictor 124, inter predictor 126, and prediction controller 128.Alternatively, encoder 100 may be realized as one or more dedicatedelectronic circuits corresponding to splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, loop filter 120, intrapredictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, each component included in encoder 100 will be described.

(Splitter)

Splitter 102 splits each picture included in an inputted moving pictureinto blocks, and outputs each block to subtractor 104. For example,splitter 102 first splits a picture into blocks of a fixed size (forexample, 128×128). The fixed size block may also be referred to as acoding tree unit (CTU). Splitter 102 then splits each fixed size blockinto blocks of variable sizes (for example, 64×64 or smaller) based, forexample, on recursive quadtree and/or binary tree block splitting. Thevariable size block may also be referred to as a coding unit (CU), aprediction unit (PU), or a transform unit (TU). In variousimplementations there may be no need to differentiate between CU, PU,and TU; all or some of the blocks in a picture may be processed per CU,PU, or TU.

FIG. 2 illustrates one example of block splitting according to anembodiment. In FIG. 2, the solid lines represent block boundaries ofblocks split by quadtree block splitting, and the dashed lines representblock boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square 128×128 pixel block (128×128 block). This128×128 block 10 is first split into four square 64×64 blocks (quadtreeblock splitting).

The top left 64×64 block is further vertically split into two rectangle32×64 blocks, and the left 32×64 block is further vertically split intotwo rectangle 16×64 blocks (binary tree block splitting). As a result,the top left 64×64 block is split into two 16×64 blocks 11 and 12 andone 32×64 block 13.

The top right 64×64 block is horizontally split into two rectangle 64×32blocks 14 and 15 (binary tree block splitting).

The bottom left 64×64 block is first split into four square 32×32 blocks(quadtree block splitting). The top left block and the bottom rightblock among the four 32×32 blocks are further split. The top left 32×32block is vertically split into two rectangle 16×32 blocks, and the right16×32 block is further horizontally split into two 16×16 blocks (binarytree block splitting). The bottom right 32×32 block is horizontallysplit into two 32×16 blocks (binary tree block splitting). As a result,the bottom left 64×64 block is split into 16×32 block 16, two 16×16blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21and 22.

The bottom right 64×64 block 23 is not split.

As described above, in FIG. 2, block 10 is split into 13 variable sizeblocks 11 through 23 based on recursive quadtree and binary tree blocksplitting. This type of splitting is also referred to as quadtree plusbinary tree (QTBT) splitting.

While in FIG. 2 one block is split into four or two blocks (quadtree orbinary tree block splitting), splitting is not limited to theseexamples. For example, one block may be split into three blocks (ternaryblock splitting). Splitting including such ternary block splitting isalso referred to as multi-type tree (MBT) splitting.

(Subtractor)

Subtractor 104 subtracts a prediction signal (prediction sample,inputted from prediction controller 128, to be described below) from anoriginal signal (original sample) per block split by and inputted fromsplitter 102. In other words, subtractor 104 calculates predictionerrors (also referred to as “residuals”) of a block to be encoded(hereinafter referred to as a “current block”). Subtractor 104 thenoutputs the calculated prediction errors (residuals) to transformer 106.

The original signal is a signal input into encoder 100, and is a signalrepresenting an image for each picture included in a moving picture (forexample, a luma signal and two chroma signals). Hereinafter, a signalrepresenting an image is also referred to as a sample.

(Transformer)

Transformer 106 transforms spatial domain prediction errors intofrequency domain transform coefficients, and outputs the transformcoefficients to quantizer 108. More specifically, transformer 106applies, for example, a defined discrete cosine transform (DCT) ordiscrete sine transform (DST) to spatial domain prediction errors. Thedefined transform may be predefined.

Note that transformer 106 may adaptively select a transform type fromamong a plurality of transform types, and transform prediction errorsinto transform coefficients by using a transform basis functioncorresponding to the selected transform type. This sort of transform isalso referred to as explicit multiple core transform (EMT) or adaptivemultiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII,DST-I, and DST-VII. FIG. 3 is a chart indicating transform basisfunctions for each transform type. In FIG. 3, N indicates the number ofinput pixels. For example, selection of a transform type from among theplurality of transform types may depend on the prediction type (intraprediction and inter prediction) as well as intra prediction mode.

Information indicating whether to apply EMT or AMT (referred to as, forexample, an EMT flag or an AMT flag) and information indicating theselected transform type is typically signaled at the CU level. Note thatthe signaling of such information need not be performed at the CU level,and may be performed at another level (for example, at the bit sequencelevel, picture level, slice level, tile level, or CTU level).

Moreover, transformer 106 may apply a secondary transform to thetransform coefficients (transform result). Such a secondary transform isalso referred to as adaptive secondary transform (AST) or non-separablesecondary transform (NSST). For example, transformer 106 applies asecondary transform to each sub-block (for example, each 4×4 sub-block)included in the block of the transform coefficients corresponding to theintra prediction errors. Information indicating whether to apply NSSTand information related to the transform matrix used in NSST aretypically signaled at the CU level. Note that the signaling of suchinformation need not be performed at the CU level, and may be performedat another level (for example, at the sequence level, picture level,slice level, tile level, or CTU level).

Either a separate transform or a non-separable transform may be appliedin transformer 106. A separate transform is a method in which atransform is performed a plurality of times by separately performing atransform for each direction according to the number of dimensionsinput. A non-separable transform is a method of performing a collectivetransform in which two or more dimensions in a multidimensional inputare collectively regarded as a single dimension.

In one example of a non-separable transform, when the input is a 4×4block, the 4×4 block is regarded as a single array including 16components, and the transform applies a 16×16 transform matrix to thearray.

In another example of a non-separable transform, after the input 4×4block is regarded as a single array including 16 components, a transformthat performs a plurality of Givens rotations (e.g., a Hypercube-GivensTransform) may be applied on the array.

(Quantizer)

Quantizer 108 quantizes the transform coefficients output fromtransformer 106. More specifically, quantizer 108 scans, in a determinedscanning order, the transform coefficients of the current block, andquantizes the scanned transform coefficients based on quantizationparameters (QP) corresponding to the transform coefficients. Thedetermined scanning order may be predetermined. Quantizer 108 thenoutputs the quantized transform coefficients (hereinafter referred to asquantized coefficients) of the current block to entropy encoder 110 andinverse quantizer 112.

A determined scanning order is an order for quantizing/inversequantizing transform coefficients. For example, a determined scanningorder is defined as ascending order of frequency (from low to highfrequency) or descending order of frequency (from high to lowfrequency).

A quantization parameter (QP) is a parameter defining a quantizationstep size (quantization width). For example, if the value of thequantization parameter increases, the quantization step size alsoincreases. In other words, if the value of the quantization parameterincreases, the quantization error increases.

(Entropy Encoder)

Entropy encoder 110 generates an encoded signal (encoded bitstream)based on the quantized coefficients, which are inputted from quantizer108. More specifically, for example, entropy encoder 110 binarizesquantized coefficients and arithmetic encodes the binary signal, tooutput a compressed bitstream or sequence.

(Inverse Quantizer)

Inverse quantizer 112 inverse quantizes the quantized coefficients,which are inputted from quantizer 108. More specifically, inversequantizer 112 inverse quantizes, in a determined scanning order,quantized coefficients of the current block. Inverse quantizer 112 thenoutputs the inverse quantized transform coefficients of the currentblock to inverse transformer 114. The determined scanning order may bepredetermined.

(Inverse Transformer) Inverse transformer 114 restores prediction errors(residuals) by inverse transforming the transform coefficients, whichare inputted from inverse quantizer 112. More specifically, inversetransformer 114 restores the prediction errors of the current block byapplying an inverse transform corresponding to the transform applied bytransformer 106 on the transform coefficients. Inverse transformer 114then outputs the restored prediction errors to adder 116.

Note that since, typically, information is lost in quantization, therestored prediction errors do not match the prediction errors calculatedby subtractor 104. In other words, the restored prediction errorstypically include quantization errors.

(Adder)

Adder 116 reconstructs the current block by summing prediction errors,which are inputted from inverse transformer 114, and prediction samples,which are inputted from prediction controller 128. Adder 116 thenoutputs the reconstructed block to block memory 118 and loop filter 120.A reconstructed block is also referred to as a local decoded block.

(Block Memory)

Block memory 118 is storage for storing blocks in a picture to beencoded (referred to as a “current picture”) for reference in intraprediction, for example. More specifically, block memory 118 storesreconstructed blocks output from adder 116.

(Loop Filter) Loop filter 120 applies a loop filter to blocksreconstructed by adder 116, and outputs the filtered reconstructedblocks to frame memory 122. A loop filter is a filter used in anencoding loop (in-loop filter), and includes, for example, a deblockingfilter (DF), a sample adaptive offset (SAO), and an adaptive loop filter(ALF).

In ALF, a least square error filter for removing compression artifactsis applied. For example, one filter from among a plurality of filters isselected for each 2×2 sub-block in the current block based on directionand activity of local gradients, and is applied.

More specifically, first, each sub-block (for example, each 2×2sub-block) is categorized into one out of a plurality of classes (forexample, 15 or 25 classes). The classification of the sub-block is basedon gradient directionality and activity. For example, classificationindex C is derived based on gradient directionality D (for example, 0 to2 or 0 to 4) and gradient activity A (for example, 0 to 4) (for example,C=5D+A). Then, based on classification index C, each sub-block iscategorized into one out of a plurality of classes.

For example, gradient directionality D is calculated by comparinggradients of a plurality of directions (for example, the horizontal,vertical, and two diagonal directions). Furthermore, for example,gradient activity A is calculated by summing gradients of a plurality ofdirections and quantizing the sum.

The filter to be used for each sub-block is determined from among theplurality of filters based on the result of such categorization.

The filter shape to be used in ALF is, for example, a circular symmetricfilter shape. FIGS. 4A, 4B, and 4C illustrate examples of filter shapesused in ALF. FIG. 4A illustrates a 5×5 diamond shape filter, FIG. 4Billustrates a 7×7 diamond shape filter, and FIG. 4C illustrates a 9×9diamond shape filter. Information indicating the filter shape istypically signaled at the picture level. Note that the signaling ofinformation indicating the filter shape need not be performed at thepicture level, and may be performed at another level (for example, atthe sequence level, slice level, tile level, CTU level, or CU level).

The enabling or disabling of ALF may be determined at the picture levelor CU level. For example, for luma, the decision to apply ALF or not maybe done at the CU level, and for chroma, the decision to apply ALF ornot may be done at the picture level. Information indicating whether ALFis enabled or disabled is typically signaled at the picture level or CUlevel. Note that the signaling of information indicating whether ALF isenabled or disabled need not be performed at the picture level or CUlevel, and may be performed at another level (for example, at thesequence level, slice level, tile level, or CTU level).

The coefficients set for the plurality of selectable filters (forexample, 15 or 25 filters) is typically signaled at the picture level.Note that the signaling of the coefficients set need not be performed atthe picture level, and may be performed at another level (for example,at the sequence level, slice level, tile level, CTU level, CU level, orsub-block level).

(Frame Memory)

Frame memory 122 is storage for storing reference pictures used in interprediction, for example, and is also referred to as a frame buffer. Morespecifically, frame memory 122 stores reconstructed blocks filtered byloop filter 120.

(Intra Predictor)

Intra predictor 124 generates a prediction signal (intra predictionsignal) by intra predicting the current block with reference to a blockor blocks that are in the current picture as stored in block memory 118(also referred to as intra frame prediction). More specifically, intrapredictor 124 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using onemode from among a plurality of defined intra prediction modes. Thedefined intra prediction modes may be predefined. The intra predictionmodes typically include one or more non-directional prediction modes anda plurality of directional prediction modes.

The one or more non-directional prediction modes include, for example,planar prediction mode and DC prediction mode defined in the H.265/HEVCstandard.

The plurality of directional prediction modes include, for example, the33 directional prediction modes defined in the H.265/HEVC standard. Notethat the plurality of directional prediction modes may include 32directional prediction modes in addition to the 33 directionalprediction modes (for a total of 65 directional prediction modes).

FIG. 5A illustrates a total of 67 intra prediction modes used in intraprediction (two non-directional prediction modes and 65 directionalprediction modes). The solid arrows represent the 33 directions definedin the H.265/HEVC standard, and the dashed arrows represent theadditional 32 directions. (The two “non-directional” prediction modesare not illustrated in FIG. 5A.)

In various implementations, a luma block may be referenced in chromablock intra prediction. That is, a chroma component of the current blockmay be predicted based on a luma component of the current block. Suchintra prediction is also referred to as cross-component linear model(CCLM) prediction. The chroma block intra prediction mode thatreferences a luma block (referred to as, for example, CCLM mode) may beadded as one of the chroma block intra prediction modes.

Intra predictor 124 may correct post-intra-prediction pixel values basedon horizontal/vertical reference pixel gradients. Intra predictionaccompanied by this sort of correcting is also referred to as positiondependent intra prediction combination (PDPC). Information indicatingwhether to apply PDPC or not (referred to as, for example, a PDPC flag)is typically signaled at the CU level. Note that the signaling of thisinformation need not be performed at the CU level, and may be performedat another level (for example, on the sequence level, picture level,slice level, tile level, or CTU level).

(Inter Predictor)

Inter predictor 126 generates a prediction signal (inter predictionsignal) by inter predicting the current block with reference to a blockor blocks in a reference picture, which is different from the currentpicture and is stored in frame memory 122 (also referred to as interframe prediction). Inter prediction is performed per current block orper current sub-block (for example, per 4×4 block) in the current block.For example, inter predictor 126 performs motion estimation in areference picture for the current block or the current sub-block, tofind a reference block or sub-block in the reference picture that bestmatches the current block or sub-block. Inter predictor 126 thenperforms motion compensation (or motion prediction) based on the motionestimation, to obtain motion information (for example, a motion vector)that compensates for (or predicts) the movement or change from thereference block or sub-block to the current block or sub-block, andgenerates an inter prediction signal of the current block or sub-blockbased on the motion information. Inter predictor 126 then outputs thegenerated inter prediction signal to prediction controller 128.

The motion information used in motion compensation may be signaled in avariety of forms as the inter prediction signal. For example, a motionvector may be signaled. As another example, a difference between amotion vector and a motion vector predictor may be signaled.

Note that the inter prediction signal may be generated using motioninformation for a neighboring block in addition to motion informationfor the current block obtained from motion estimation. Morespecifically, the inter prediction signal may be generated per sub-blockin the current block by calculating a weighted sum of a predictionsignal based on motion information obtained from the motion estimation(in the reference picture) and a prediction signal based on motioninformation of a neighboring block (in the current picture). Such interprediction (motion compensation) is also referred to as overlapped blockmotion compensation (OBMC).

In OBMC mode, information indicating sub-block size for OBMC (referredto as, for example, OBMC block size) may be signaled at the sequencelevel. Further, information indicating whether to apply the OBMC mode ornot (referred to as, for example, an OBMC flag) may be signaled at theCU level. Note that the signaling of such information need not beperformed at the sequence level and CU level, and may be performed atanother level (for example, at the picture level, slice level, tilelevel, CTU level, or sub-block level).

Hereinafter, the OBMC mode will be described in further detail. FIG. 5Bis a flowchart and FIG. 5C is a conceptual diagram illustrating aprediction image correction process performed by OBMC processing.

Referring to FIG. 5C, first, a prediction image (Pred) is obtainedthrough typical motion compensation using a motion vector (MV) assignedto the target (current) block. In FIG. 5C, an arrow “MV” points to thereference picture, to indicate what the current block in the currentpicture is referencing in order to obtain a prediction image.

Next, a prediction image (Pred_L) is obtained by applying (reusing) amotion vector (MV_L), which was already derived for the encodedneighboring left block, to the target (current) block, as indicated byan arrow “MV_L” originating from the current block and pointing to thereference picture to obtain the prediction image Pred_L. Then, the twoprediction images Pred and Pred_L are superimposed to perform a firstpass of the correction of the prediction image, which in one aspect hasan effect of blending the border between the neighboring blocks.

Similarly, a prediction image (Pred_U) is obtained by applying (reusing)a motion vector (MV U), which was already derived for the encodedneighboring upper block, to the target (current) block, as indicated byan arrow “MV U” originating from the current block and pointing to thereference picture to obtain the prediction image Pred_U. Then, theprediction image Pred_U is superimposed with the prediction imageresulting from the first pass (i.e., Pred and Pred_L) to perform asecond pass of the correction of the prediction image, which in oneaspect has an effect of blending the border between the neighboringblocks. The result of the second pass is the final prediction image forthe current block, with blended (smoothed) borders with its neighboringblocks.

Note that the above example is of a two-pass correction method using theneighboring left and upper blocks, but the method may be a three-pass orhigher-pass correction method that also uses the neighboring rightand/or lower block.

Note that the region subject to superimposition may be the entire pixelregion of the block, and, alternatively, may be a partial block boundaryregion.

Note that here, the prediction image correction process of OBMC isdescribed as being based on a single reference picture to derive asingle prediction image Pred, to which additional prediction imagesPred_L and Pred_U are superimposed, but the same process may apply toeach of a plurality of reference pictures when the prediction image iscorrected based on the plurality of reference pictures. In such a case,after a plurality of corrected prediction images are obtained byperforming the image correction of OBMC based on the plurality ofreference pictures, respectively, the obtained plurality of correctedprediction images are superimposed to obtain the final prediction image.

Note that, in OBMC, the unit of the target block may be a predictionblock and, alternatively, may be a sub-block obtained by dividing theprediction block.

One example of a method to determine whether to implement OBMCprocessing is to use an obmc flag, which is a signal that indicateswhether to implement OBMC processing. As one specific example, theencoder may determine whether the target block belongs to a regionincluding complicated motion. The encoder sets the obmc flag to a valueof “1” when the block belongs to a region including complicated motionand implements OBMC processing during encoding, and sets the obmc flagto a value of “0” when the block does not belong to a region includingcomplication motion and encodes the block without implementing OBMCprocessing. The decoder switches between implementing OBMC processing ornot by decoding the obmc flag written in the stream (i.e., thecompressed sequence) and performing the decoding in accordance with theflag value.

Note that the motion information may be derived on the decoder sidewithout being signaled from the encoder side. For example, a merge modedefined in the H.265/HEVC standard may be used. Furthermore, forexample, the motion information may be derived by performing motionestimation on the decoder side. In this case, the decoder side mayperform motion estimation without using the pixel values of the currentblock.

Here, a mode for performing motion estimation on the decoder side willbe described. A mode for performing motion estimation on the decoderside is also referred to as pattern matched motion vector derivation(PMMVD) mode or frame rate up-conversion (FRUC) mode.

One example of FRUC processing is illustrated in FIG. 5D. First, acandidate list (a candidate list may be a merge list) of candidates,each including a prediction motion vector (MV), is generated withreference to motion vectors of encoded blocks that spatially ortemporally neighbor the current block. Next, the best candidate MV isselected from among the plurality of candidate MVs registered in thecandidate list. For example, evaluation values for the candidate MVsincluded in the candidate list are calculated and one candidate MV isselected based on the calculated evaluation values.

Next, a motion vector for the current block is derived from the motionvector of the selected candidate. More specifically, for example, themotion vector for the current block is calculated as the motion vectorof the selected candidate (the best candidate MV), as-is. Alternatively,the motion vector for the current block may be derived by patternmatching performed in the vicinity of a position in a reference picturecorresponding to the motion vector of the selected candidate. In otherwords, when the vicinity of the best candidate MV is searched usingpattern matching in a reference picture and evaluation values, and an MVhaving a better evaluation value is found, the best candidate MV may beupdated to the MV having the better evaluation value, and the MV havingthe better evaluation value may be used as the final MV for the currentblock. A configuration in which the processing to update the MV having abetter evaluation value is not implemented is also acceptable.

The same processes may be performed in cases in which the processing isperformed in units of sub-blocks.

An evaluation value may be calculated in various ways. For example, areconstructed image of a region in a reference picture corresponding toa motion vector is compared with a reconstructed image of a determinedregion (which may be in another reference picture or in a neighboringblock in the current picture, for example, as described below), and adifference in pixel values between the two reconstructed images may becalculated and used as an evaluation value of the motion vector. Thedetermined region may be predetermined. Note that the evaluation valuemay be calculated by using some other information in addition to thedifference.

Next, pattern matching is described in detail. First, one candidate MVincluded in a candidate list (e.g., a merge list) is selected as thestarting point for the search by pattern matching. The pattern matchingused is either first pattern matching or second pattern matching. Firstpattern matching and second pattern matching are also referred to asbilateral matching and template matching, respectively.

In first pattern matching, pattern matching is performed between twoblocks in two different reference pictures that are both along themotion trajectory of the current block. Therefore, in first patternmatching, for a region in a reference picture, a region in anotherreference picture that conforms to the motion trajectory of the currentblock is used as the determined region for the above-describedcalculation of the candidate's evaluation value.

FIG. 6 illustrates one example of first pattern matching (bilateralmatching) between two blocks in two reference pictures along a motiontrajectory. As illustrated in FIG. 6, in first pattern matching, twomotion vectors (MV0, MV1) are derived by finding the best match betweenthe two blocks in two different reference pictures (Ref0, Ref1) alongthe motion trajectory of the current block (Cur block). Morespecifically, a difference may be obtained between (i) a reconstructedimage at a position specified by a candidate MV in a first encodedreference picture (Ref0), and (ii) a reconstructed image at a positionspecified by the candidate MV, which is symmetrically scaled per displaytime intervals, in a second encoded reference picture (Ref1). Then, thedifference may be used to derive an evaluation value for the currentblock. A candidate MV having the best evaluation value among a pluralityof candidate MVs may be selected as the final MV.

Under the assumption of continuous motion trajectory, the motion vectors(MV0, MV1) pointing to the two reference blocks are proportional to thetemporal distances (TD0, TD1) between the current picture (Cur Pic) andthe two reference pictures (Ref0, Ref1). For example, when the currentpicture is temporally between the two reference pictures, and thetemporal distance from the current picture to the two reference picturesis the same, first pattern matching derives two mirroring bi-directionalmotion vectors.

In second pattern matching (template matching), pattern matching isperformed between a template in the current picture (blocks neighboringthe current block in the current picture; for example, the top and/orleft neighboring blocks) and a block in a reference picture. Therefore,in second pattern matching, a block neighboring the current block in thecurrent picture is used as the determined region for the above-describedcalculation of the candidate evaluation value.

FIG. 7 illustrates one example of pattern matching (template matching)between a template in the current picture and a block in a referencepicture. As illustrated in FIG. 7, in second pattern matching, a motionvector of the current block is derived by searching in a referencepicture (Ref0) to find a block that best matches neighboring block(s) ofthe current block (Cur block) in the current picture (Cur Pic). Morespecifically, a difference may be obtained between (i) a reconstructedimage of one or both of encoded neighboring upper and left regionsrelative to the current block, and (ii) a reconstructed image of thesame regions relative to a block position specified by a candidate MV inan encoded reference picture (Ref0). Then, the difference may be used toderive an evaluation value for the current block. A candidate MV havingthe best evaluation value among a plurality of candidate MVs may beselected as the best candidate MV.

Information indicating whether to apply the FRUC mode or not (referredto as, for example, a FRUC flag) may be signaled at the CU level.Further, when the FRUC mode is applied (for example, when the FRUC flagis set to true), information indicating the pattern applicable matchingmethod (e.g., first pattern matching or second pattern matching) may besignaled at the CU level. Note that the signaling of such informationneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, CTU level, or sub-block level).

Next, methods of deriving a motion vector are described. First, adescription is given of a mode for deriving a motion vector based on amodel assuming uniform linear motion. This mode is also referred to as abi-directional optical flow (BIO) mode.

FIG. 8 illustrates a model that assumes uniform linear motion. In FIG.8, (v_(x), v_(y)) denotes a velocity vector, and τ₀ and τ₁ denotetemporal distances between the current picture (Cur Pic) and tworeference pictures (Ref₀, Ref₁), respectively. (MVx₀, MVy₀) denotes amotion vector corresponding to reference picture Ref₀, and (MVx₁, MVy₁)denotes a motion vector corresponding to reference picture Ref₁.

Here, under the assumption of uniform linear motion exhibited byvelocity vector (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) arerepresented as (v_(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁),respectively, and the following optical flow equation (Equation 1) isgiven.

∂I ^((k)) /∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0  (1)

Here, I^((k)) denotes a luma value from reference picture k (k=0, 1)after motion compensation. The optical flow equation shows that the sumof (i) the time derivative of the luma value, (ii) the product of thehorizontal velocity and the horizontal component of the spatial gradientof a reference picture, and (iii) the product of the vertical velocityand the vertical component of the spatial gradient of a referencepicture, is equal to zero. A motion vector of each block obtained from,for example, a merge list may be corrected pixel by pixel based on acombination of the optical flow equation and Hermite interpolation.

Note that a motion vector may be derived on the decoder side using amethod other than deriving a motion vector based on a model assuminguniform linear motion. For example, a motion vector may be derived foreach sub-block based on motion vectors of neighboring blocks.

Next, a description is given of a mode in which a motion vector isderived for each sub-block based on motion vectors of neighboringblocks. This mode is also referred to as affine motion compensationprediction mode.

FIG. 9A illustrates one example of deriving a motion vector of eachsub-block based on motion vectors of neighboring blocks. In FIG. 9A, thecurrent block includes 16 4×4 sub-blocks. Here, motion vector v₀ of thetop left corner control point in the current block is derived based onmotion vectors of neighboring sub-blocks. Similarly, motion vector v₁ ofthe top right corner control point in the current block is derived basedon motion vectors of neighboring blocks. Then, using the two motionvectors v₀ and v₁, the motion vector (v_(x), v_(y)) of each sub-block inthe current block is derived using Equation 2 below.

$\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1\; x} - v_{0x}} \right)}{w}y} + v_{0y}}}\end{matrix} \right. & (2)\end{matrix}$

Here, x and y are the horizontal and vertical positions of thesub-block, respectively, and w is a determined weighted coefficient. Thedetermined weighted coefficient may be predetermined.

An affine motion compensation prediction mode may include a number ofmodes of different methods of deriving the motion vectors of the topleft and top right corner control points. Information indicating anaffine motion compensation prediction mode (referred to as, for example,an affine flag) may be signaled at the CU level. Note that the signalingof information indicating the affine motion compensation prediction modeneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, CTU level, or sub-block level).

(Prediction Controller)

Prediction controller 128 selects either the intra prediction signal(outputted from intra predictor 124) or the inter prediction signal(outputted from inter predictor 126), and outputs the selectedprediction signal to subtractor 104 and adder 116.

As illustrated in FIG. 1, in various implementations, the predictioncontroller 128 may output prediction parameters, which are inputted toentropy encoder 110. Entropy encoder 110 may generate an encodedbitstream (or sequence) based on the prediction parameters, inputtedfrom prediction controller 128, and the quantized coefficients, inputtedfrom quantizer 108. The prediction parameters may be used by thedecoder, which receives and decodes the encoded bitstream, to carry outthe same prediction processing as performed in intra predictor 124,inter predictor 126, and prediction controller 128. The predictionparameters may include the selected prediction signal (e.g., motionvectors, prediction type or prediction mode employed in intra predictor124 or inter predictor 126), or any index, flag, or value that is basedon, or is indicative of, the prediction processing performed in intrapredictor 124, inter predictor 126, and prediction controller 128.

In some implementations, prediction controller 128 operates in mergemode to optimize motion vectors calculated for a current picture usingboth the intra prediction signal from the intra predictor 124 and theinter prediction signal from the inter predictor 126. FIG. 9Billustrates one example of a process for deriving a motion vector in acurrent picture in merge mode.

First, a prediction MV list is generated, in which prediction MVcandidates are registered. Examples of prediction MV candidates include:spatially neighboring prediction MV, which are MVs of encoded blockspositioned in the spatial vicinity of the target block; temporallyneighboring prediction MVs, which are MVs of blocks in encoded referencepictures that neighbor a block in the same location as the target block;a coupled prediction MV, which is an MV generated by combining the MVvalues of the spatially neighboring prediction MV and the temporallyneighboring prediction MV; and a zero prediction MV, which is an MVwhose value is zero.

Next, the MV of the target block is determined by selecting oneprediction MV from among the plurality of prediction MVs registered inthe prediction MV list.

Further, in a variable-length encoder, a merge_idx, which is a signalindicating which prediction MV is selected, is written and encoded intothe stream.

Note that the prediction MVs registered in the prediction MV listillustrated in FIG. 9B constitute one example. The number of predictionMVs registered in the prediction MV list may be different from thenumber illustrated in FIG. 9B, and the prediction MVs registered in theprediction MV list may omit one or more of the types of prediction MVsgiven in the example in FIG. 9B, and the prediction MVs registered inthe prediction MV list may include one or more types of prediction MVsin addition to and different from the types given in the example in FIG.9B.

The final MV may be determined by performing DMVR (dynamic motion vectorrefreshing) processing (to be described later) by using the MV of thetarget block derived in merge mode.

FIG. 9C is a conceptual diagram illustrating an example of DMVRprocessing to determine an MV.

First, the most appropriate MV which is set for the current block (e.g.,in merge mode) is considered to be the candidate MV. Then, according tocandidate MV(L0), a reference pixel is identified in a first referencepicture (L0) which is an encoded picture in L0 direction. Similarly,according to candidate MV(L1), a reference pixel is identified in asecond reference picture (L1) which is an encoded picture in L1direction. The reference pixels are then averaged to form a template.

Next, using the template, the surrounding regions of the candidate MVsof the first and second reference pictures (L0) and (L1) are searched,and the MV with the lowest cost is determined to be the final MV. Thecost value may be calculated, for example, using the difference betweeneach pixel value in the template and each pixel value in the regionssearched, using the candidate MVs, etc.

Note that the configuration and operation of the processes describedhere are fundamentally the same in both the encoder side and the decoderside, to be described below.

Any processing other than the processing described above may be used, aslong as the processing is capable of deriving the final MV by searchingthe surroundings of the candidate MV.

Next, a description is given of an example of a mode that generates aprediction image (a prediction) using LIC (local illuminationcompensation) processing.

FIG. 9D illustrates one example of a prediction image generation methodusing a luminance correction process performed by LIC processing.

First, from an encoded reference picture, an MV is derived to obtain areference image corresponding to the current block.

Next, for the current block, information indicating how the luminancevalue changed between the reference picture and the current picture isobtained, based on the luminance pixel values of the encoded neighboringleft reference region and the encoded neighboring upper reference regionin the current picture, and based on the luminance pixel values in thesame locations in the reference picture as specified by the MV. Theinformation indicating how the luminance value changed is used tocalculate a luminance correction parameter.

The prediction image for the current block is generated by performing aluminance correction process, which applies the luminance correctionparameter on the reference image in the reference picture specified bythe MV.

Note that the shape of the surrounding reference region(s) illustratedin FIG. 9D is just one example; the surrounding reference region mayhave a different shape.

Furthermore, although a prediction image is generated from a singlereference picture in this example, in cases in which a prediction imageis generated from a plurality of reference pictures, the predictionimage may be generated after performing a luminance correction process,as described above, on the reference images obtained from the referencepictures.

One example of a method for determining whether to implement LICprocessing is using an lic_flag, which is a signal that indicateswhether to implement LIC processing. As one specific example, theencoder determines whether the current block belongs to a region ofluminance change. The encoder sets the lic_flag to a value of “1” whenthe block belongs to a region of luminance change, and implements LICprocessing when encoding. The encoder sets the lic_flag to a value of“0” when the block does not belong to a region of luminance change, andperforms encoding implementing LIC processing. The decoder may switchbetween implementing LIC processing or not by decoding the lic_flagwritten in the stream and performing the decoding in accordance with theflag value.

One example of a different method of determining whether to implementLIC processing includes discerning whether LIC processing was determinedto be implemented for a surrounding block. In one specific example, whenmerge mode is used on the current block, it is determined whether LICprocessing was applied in the encoding of the surrounding encoded block,which was selected when deriving the MV in merge mode. Then, thedetermination is used to determine whether to implement LIC processingor not for the current block. Note that in this example also, the sameapplies to the processing performed on the decoder side.

Decoder

Next, a decoder capable of decoding an encoded signal (encodedbitstream) output from encoder 100 will be described. FIG. 10 is a blockdiagram illustrating a functional configuration of decoder 200 accordingto an embodiment. Decoder 200 is a moving picture decoder that decodes amoving picture block by block.

As illustrated in FIG. 10, decoder 200 includes entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, block memory210, loop filter 212, frame memory 214, intra predictor 216, interpredictor 218, and prediction controller 220.

Decoder 200 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, loop filter212, intra predictor 216, inter predictor 218, and prediction controller220. Alternatively, decoder 200 may be realized as one or more dedicatedelectronic circuits corresponding to entropy decoder 202, inversequantizer 204, inverse transformer 206, adder 208, loop filter 212,intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, each component included in decoder 200 will be described.

(Entropy Decoder)

Entropy decoder 202 entropy decodes an encoded bitstream. Morespecifically, for example, entropy decoder 202 arithmetic decodes anencoded bitstream into a binary signal. Entropy decoder 202 thendebinarizes the binary signal. Entropy decoder 202 outputs quantizedcoefficients of each block to inverse quantizer 204. Entropy decoder 202may also output the prediction parameters, which may be included in theencoded bitstream (see FIG. 1), to intra predictor 216, inter predictor218, and prediction controller 220 so that they can carry out the sameprediction processing as performed on the encoder side in intrapredictor 124, inter predictor 126, and prediction controller 128.

(Inverse Quantizer)

Inverse quantizer 204 inverse quantizes quantized coefficients of ablock to be decoded (hereinafter referred to as a current block), whichare inputted from entropy decoder 202. More specifically, inversequantizer 204 inverse quantizes quantized coefficients of the currentblock based on quantization parameters corresponding to the quantizedcoefficients. Inverse quantizer 204 then outputs the inverse quantizedcoefficients (i.e., transform coefficients) of the current block toinverse transformer 206.

(Inverse Transformer)

Inverse transformer 206 restores prediction errors (residuals) byinverse transforming transform coefficients, which are inputted frominverse quantizer 204.

For example, when information parsed from an encoded bitstream indicatesapplication of EMT or AMT (for example, when the AMT flag is set totrue), inverse transformer 206 inverse transforms the transformcoefficients of the current block based on information indicating theparsed transform type.

Moreover, for example, when information parsed from an encoded bitstreamindicates application of NSST, inverse transformer 206 applies asecondary inverse transform to the transform coefficients.

(Adder)

Adder 208 reconstructs the current block by summing prediction errors,which are inputted from inverse transformer 206, and prediction samples,which is an input from prediction controller 220. Adder 208 then outputsthe reconstructed block to block memory 210 and loop filter 212.

(Block Memory)

Block memory 210 is storage for storing blocks in a picture to bedecoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 210 storesreconstructed blocks output from adder 208.

(Loop Filter)

Loop filter 212 applies a loop filter to blocks reconstructed by adder208, and outputs the filtered reconstructed blocks to frame memory 214and, for example, to a display device.

When information indicating the enabling or disabling of ALF parsed froman encoded bitstream indicates enabled, one filter from among aplurality of filters is selected based on direction and activity oflocal gradients, and the selected filter is applied to the reconstructedblock.

(Frame Memory)

Frame memory 214 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 214 stores reconstructed blocks filtered byloop filter 212.

(Intra Predictor)

Intra predictor 216 generates a prediction signal (intra predictionsignal) by intra prediction with reference to a block or blocks in thecurrent picture as stored in block memory 210. More specifically, intrapredictor 216 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 220.

Note that when an intra prediction mode in which a chroma block is intrapredicted from a luma block is selected, intra predictor 216 may predictthe chroma component of the current block based on the luma component ofthe current block.

Moreover, when information indicating the application of PDPC is parsedfrom an encoded bitstream (in the prediction parameters outputted fromentropy decoder 202, for example), intra predictor 216 correctspost-intra-prediction pixel values based on horizontal/verticalreference pixel gradients.

(Inter Predictor)

Inter predictor 218 predicts the current block with reference to areference picture stored in frame memory 214. Inter prediction isperformed per current block or per sub-block (for example, per 4×4block) in the current block. For example, inter predictor 218 generatesan inter prediction signal of the current block or sub-block based onmotion compensation using motion information (for example, a motionvector) parsed from an encoded bitstream (in the prediction parametersoutputted from entropy decoder 202, for example), and outputs the interprediction signal to prediction controller 220.

When the information parsed from the encoded bitstream indicatesapplication of OBMC mode, inter predictor 218 generates the interprediction signal using motion information for a neighboring block inaddition to motion information for the current block obtained frommotion estimation.

Moreover, when the information parsed from the encoded bitstreamindicates application of FRUC mode, inter predictor 218 derives motioninformation by performing motion estimation in accordance with thepattern matching method (bilateral matching or template matching) parsedfrom the encoded bitstream. Inter predictor 218 then performs motioncompensation (prediction) using the derived motion information.

Moreover, when BIO mode is to be applied, inter predictor 218 derives amotion vector based on a model assuming uniform linear motion. Further,when the information parsed from the encoded bitstream indicates thataffine motion compensation prediction mode is to be applied, interpredictor 218 derives a motion vector of each sub-block based on motionvectors of neighboring blocks.

(Prediction Controller)

Prediction controller 220 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto adder 208. Furthermore, prediction controller 220 may perform variousfunctions and operations, such as merge mode (see FIG. 9B), DMVRprocessing (see FIG. 9C), and LIC processing (FIG. 9D) as describedabove in reference to prediction controller 128 on the encoder side. Ingeneral, the configuration, functions and operations of predictioncontroller 220, inter predictor 218 and intra predictor 216 on thedecoder side may correspond to the configuration, functions andoperations of prediction controller 128, inter predictor 126 and intrapredictor 124 on the encoder side.

Embodiment 1 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; determineswhether the parameter written is equal to a determined value; when theparameter written is equal to the determined value, predicts blockpartitioning information and partitions a block into a plurality of subblocks using the block partitioning information predicted; when theparameter written is not equal to the determined value, partitions ablock into a plurality of sub blocks without using the blockpartitioning information predicted; and encodes a sub block included inthe plurality of sub blocks in an encoding process including a transformprocess and/or a prediction process. The determined value may bepredetermined.

This makes it possible to predict block partitioning information whenthe parameter is equal to a determined value. Partitioning a block usingthe predicted block partitioning information makes it possible to reducethe amount of coding pertaining to block partitioning information andimprove compression efficiency.

For example, in the encoder according to this embodiment, a process topredict the block partitioning information may include a process ofgenerating the block partitioning information using block informationfrom a previously encoded block.

This makes it possible to predict block partitioning information usingblock information for a previously encoded block, which makes itpossible to improve the prediction accuracy of block partitioninginformation and reduce the amount of coding.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory. Using the memory, the processor: parsesa parameter from a bitstream; determines whether the parameter parsed isequal to a determined value; when the parameter parsed is equal to thedetermined value, predicts block partitioning information and partitionsa block into a plurality of sub blocks using the block partitioninginformation predicted; when the parameter parsed is not equal to thedetermined value, partitions a block into a plurality of sub blockswithout using the block partitioning information predicted; and decodesa sub block included in the plurality of sub blocks in a decodingprocess including an inverse transform process and/or a predictionprocess. The determined value may be predetermined.

This makes it possible to predict block partitioning information whenthe parameter is equal to a determined value. Partitioning a block usingthe predicted block partitioning information makes it possible to reducethe amount of coding pertaining to block partitioning information andimprove compression efficiency.

For example, in the decoder according to this embodiment, a process topredict the block partitioning information may include a process ofgenerating the block partitioning information using block informationfrom a previously decoded block.

This makes it possible to predict block partitioning information usingblock information for a previously decoded block, which makes itpossible to improve the prediction accuracy of block partitioninginformation and reduce the amount of coding.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 11 and FIG. 12.Moreover, apparatuses for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 35 and FIG. 36.

[Encoding Process]

FIG. 11 illustrates one example of a video encoding process according toEmbodiment 1.

As a first step S1001, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream. The written parameters include one or moreparameters for identifying whether the prediction of block partitioninginformation is enabled. For example, the one or more parameters caninclude a flag to indicate whether the prediction of block partitioninginformation is enabled.

Next, at step S1002, whether the written parameters are equal todetermined values is determined. The determined values may bepredetermined. If the written parameters are equal to determined values(Y in S1002), block partitioning information is predicted at step S1003and a block is then partitioned into a plurality of sub blocks using thepredicted block partitioning information at step S1004. For example, thepredicted block partitioning information can be used as an initial blockpartitioning information. The initial block partitioning informationwill then be updated to the final block partitioning information.

The final block partitioning information is decided against otherpossible block partitioning information during intra and interprediction processes based on a lowest rate distortion cost. Thedifference information between the predicted block partitioninginformation and final block partitioning information will be writteninto a bitstream for a decoder to generate the corresponding final blockpartitioning information based on the same predicted block partitioninginformation. Coding the difference information instead of the finalblock partitioning information reduces the bits required to signal thefinal block partitioning information.

The partitioning methods, for example, can be a binary split as shown byb1) and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) inFIG. 41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or anon square/rectangle split as shown by n1) in FIG. 41. The geometries(shape and/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

Here, the block partitioning information can be predicted according toblock information (for example, block partition structure, intraprediction or inter prediction mode, intra prediction direction, motionvector, reference picture, quantization parameters, and partitioningdepth) from previously encoded blocks. Using block partitioninginformation will result in partitioning a block into a plurality of subblocks. As shown in FIG. 38, using different block partitioninginformation will result in partitioning a block into a plurality of subblocks with different heights, widths, or shapes.

Block partition structure from a previously encoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously encoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block.

One example of how to select previously encoded blocks is to selectencoded blocks having same intra/inter prediction mode as current block.Specifically, if the current block is an inter predicted block, one ormore of the previously encoded blocks that were encoded using interprediction will be selected.

Block partition structure from a previously encoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined.

Predicted block partitioning information may differ based on intraprediction direction information from previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, if intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for the current block. Similarly, if intraprediction direction information from a left neighbouring block isdetermined to be a horizontal direction or close to a horizontaldirection, a block partitioning information including a horizontal splitcan be predicted for the current block.

Block partitioning information may be a set of parameters that includean index to select one candidate partition structure from a determinedcandidate list of block partition structures. The determined candidatelist may be predetermined. Here, block partition structure visuallypresents geometries of all sub blocks in a block, as shown in FIG. 38.

Block partitioning information may be predicted according to intra/interprediction modes from previously encoded blocks. When prediction modesfrom the encoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined. When prediction modesfrom the encoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously encoded blocks. When a difference between themotion vectors from the encoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the encoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined block partitioning information may bepredetermined, and the determined thresholds may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously encoded blocks. For example,when the values of quantization parameters from the encoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the encoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined block partitioning information may bepredetermined, and the determined values may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously encoded blocks. For example, whenreference pictures from the encoded blocks are temporally near to thecurrent image or when the reference pictures from the encoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the encoded blocks arenot near to the current image or when the reference pictures from theencoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously encoded blocks. For example, whenpartitioning depths from the encoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the encoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined, and the determinedvalues may be predetermined.

Block partitioning information may also be predicted according topartitioning information from previously encoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be predicted from a previouslyencoded block (e.g., a collocated block, the last encoded block or anencoded block identified by a motion vector) from an encoded frame whichis different from current frame.

If the written parameters are not equal to determined values (N inS1002), a block is partitioned into a plurality of sub blocks withoutusing the predicted block partitioning information at step S1005. Thepartitioning methods, for example, can be a binary split as shown by b1)and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) in FIG.41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41. The determined values may be predetermined.

At step S1006, a sub block from the plurality of sub blocks is encodedin an encoding process. Here, the encoding process includes a transformprocess and/or a prediction process. The transform process may beperformed on a per block basis similar to the sub block size.

[Encoder]

FIG. 35 is a block diagram which shows a structure of a video/imageencoder according to an embodiment.

Video encoder 25000 is for encoding an input video/image bitstream on ablock-by-block basis so as to generate an encoded output bitstream. Asshown in FIG. 35, video encoder 25000 includes transformer 25001,quantizer 25002, inverse quantizer 25003, inverse transformer 25004,block memory 25005, frame memory 25006, intra predictor 25007, interpredictor 25008, entropy encoder 25009 and block partitioninginformation determiner 25010.

An input video is inputted to an adder, and the added value is outputtedto transformer 25001. Transformer 25001 transforms the added values intofrequency coefficients at the derived block partitioning informationfrom block partitioning information determiner 25010, and outputs theresulting frequency coefficients to quantizer 25002. Quantizer 25002quantizes the inputted frequency coefficients, and outputs the resultingquantized values to inverse quantizer 25003 and entropy encoder 25009.

Inverse quantizer 25003 inversely quantizes the quantized valuesoutputted from quantizer 25002, and outputs the frequency coefficientsto the inverse transformer 25004. Inverse transformer 25004 performsinverse frequency transform on the frequency coefficients at the derivedblock partitioning information from block partitioning informationdeterminer 25010, so as to transform the frequency coefficients intosample values of the bitstream, and outputs the resulting sample valuesto an adder.

The adder adds the sample values of the bitstream outputted from inversetransformer 25004 to the predicted video/image values outputted fromintra predictor 25007/inter predictor 25008, and outputs the resultingadded values to block memory 25005 or frame memory 25006 for furtherprediction.

Block partitioning information determiner 25010 collects blockinformation from block memory 25005 or frame memory 25006 to deriveblock partitioning information and parameters related to blockpartitioning information. Here, using the derived block partitioninginformation will result in partitioning a block into a plurality of subblocks.

Intra predictor 25007/inter predictor 25008 searches withinreconstructed videos/images stored in block memory 25005 or fromreconstructed videos/images in frame memory 25006 at the derived blockpartitioning information from block partitioning information determiner25010, and estimates a video/image area which is, for example, mostsimilar to the input videos/images for prediction.

Entropy encoder 25009 encodes the quantized values outputted fromquantizer 25002, encodes parameters from block partitioning informationdeterminer 25010, and outputs a bitstream.

[Decoding Process]

FIG. 12 illustrates one example of a video decoding process according toEmbodiment 1.

As a first step S2001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream. The parsed parameters include one or moreparameters for identifying whether the prediction of block partitioninginformation is enabled. For example, the one or more parameters caninclude a flag to indicate whether the prediction of block partitioninginformation is enabled.

Next, at step S2002, whether the parsed parameters are equal todetermined values is determined. The determined values may bepredetermined.

If the parsed parameters are equal to determined values (Y in S2002),block partitioning information is predicted at step S2003 and a block isthen partitioned into a plurality of sub blocks using the predictedblock partitioning information at step S2004. The determined values maybe predetermined. For example, the predicted block partitioninginformation can be used as initial block partitioning information. Theinitial block partitioning information will then be updated to the finalblock partitioning information according to the difference informationbetween the predicted block partitioning information and final blockpartitioning information, which has been parsed from the bitstream. Thepartitioning methods, for example, can be a binary split as shown by b1)and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) in FIG.41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

Here, the block partitioning information can be predicted according toblock information (for example, block partition structure, intraprediction or inter prediction mode, intra prediction direction, motionvector, reference picture, quantization parameters, and partitioningdepth) from previously decoded blocks. Using block partitioninginformation will result in partitioning a block into a plurality of subblocks. As shown in FIG. 38, using different block partitioninginformation will result in partitioning a block into a plurality of subblocks with different heights, widths, or shapes.

Block partition structure from a previously decoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously decoded blockscan also be combined (for example, the top half uses the block partitionstructure from the top block and the left half uses the block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block. One example of how to select previously decoded blocks isto select decoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously decoded blocks that were decodedusing inter prediction will be selected.

Block partition structure from a previously decoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined.

Predicted block partitioning information may differ based on intraprediction direction information from previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, when intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for current block. Similarly, if intra predictiondirection information from a left neighbouring block is determined to bea horizontal direction or close to a horizontal direction, a blockpartitioning information including a horizontal split can be predictedfor the current block.

Block partitioning information may be a set of parameters that includean index to select one candidate partition structure from a determinedcandidate list of block partition structures. The determined candidatelist may be predetermined. Here, block partition structure visuallypresents geometries of all sub blocks in a block, as shown in FIG. 38.

Block partitioning information may be predicted according to intra/interprediction modes from previously decoded blocks. When prediction modesfrom the decoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. When prediction modesfrom the decoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously decoded blocks. When a difference between themotion vectors from the decoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the decoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined thresholds and the determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously decoded blocks. For example,when the values of quantization parameters from the decoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the decoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously decoded blocks. For example, whenreference pictures from the decoded blocks are temporally near to thecurrent image or when the reference pictures from the decoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the decoded blocks arenot near to the current image or when the reference pictures from thedecoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously decoded blocks. For example, whenpartitioning depths from the decoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the decoded blocks are not larger than adetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be predicted according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be predicted from a previouslydecoded block (e.g., a collocated block, the last decoded block or adecoded block identified by a motion vector) from a decoded frame whichis different from current frame.

If the written parameters are not equal to determined values (N inS2002), a block is partitioned into a plurality of sub blocks withoutusing the predicted block partitioning information at step S2005. Thepartitioning methods, for example, can be a binary split as shown by b1)and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) in FIG.41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41. The determined values may be predetermined.

At step S2006, a sub block from the plurality of sub blocks is decodedin a decoding process. Here, the decoding process includes an inversetransform process and/or a prediction process. The inverse transformprocess may be performed on a per block basis similar to the sub blocksize.

[Decoder]

FIG. 36 is a block diagram which shows a structure of a video/imagedecoder according to an embodiment.

The video decoder 26000 is an apparatus for decoding an input codedbitstream on a block-by-block basis and outputting videos/images, andincludes, as shown in FIG. 36, entropy decoder 26001, inverse quantizer26002, inverse transformer 26003, block memory 26004, frame memory26005, intra predictor 26006, inter predictor 26007 and blockpartitioning information determiner 26008.

An input encoded bitstream is inputted to entropy decoder 26001. Afterthe input encoded bitstream is inputted to entropy decoder 26001,entropy decoder 26001 decodes the input encoded bitstream, outputsparameters to block partitioning information determiner 26008, andoutputs the decoded values to inverse quantizer 26002.

Inverse quantizer 26002 inversely quantizes the decoded values, andoutputs the frequency coefficients to inverse transformer 26003. Inversetransformer 26003 performs inverse frequency transform on the frequencycoefficients at the derived block partitioning information from blockpartitioning information determiner 26008 to transform the frequencycoefficients into sample values, and outputs the resulting sample valuesto an adder.

The adder adds the resulting sample values to the predicted video/imagevalues outputted from intra predictor 26006/inter predictor 26007, andoutputs the resulting added values to a display, and outputs theresulting added values to block memory 26004 or frame memory 26005 forfurther prediction.

Block partitioning information determiner 26008 collects blockinformation from block memory 26004 or frame memory 26005 to deriveblock partitioning information using the decoded parameters from entropydecoder 26001. Here, using the derived block partitioning informationwill result in partitioning a block into a plurality of sub blocks.

In addition, intra predictor 26006/inter predictor 26007 searches withinvideos/images stored in block memory 26004 or from reconstructedvideos/images in frame memory 26005 at the derived block partitioninginformation from the block partitioning information determiner 26008,and estimates a video/image area which is, for example, most similar tothe videos/images of the decoded blocks for prediction.

Embodiment 2 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; selects atleast one previously encoded block from a plurality of previouslyencoded blocks using the parameter written; retrieves block informationfrom the at least one previously encoded block selected; partitions acurrent block into a plurality of sub blocks using the block informationretrieved; and encodes a sub block included in the plurality of subblocks in an encoding process including a transform process and/or aprediction process.

This makes it possible to adaptively select a previously encoded blockto partition the current block, using the parameter. Partitioning ablock into a plurality of sub blocks using the block information for aselected previously encoded block makes it possible to reduce the amountof coding pertaining to block partitioning information and improvecompression efficiency.

For example, in the encoder according to this embodiment, the currentblock and the plurality of previously encoded blocks may be differentblocks, and at least one of the plurality of previously encoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to select a previously encoded block to partitiona block from among a plurality of mutually different previously encodedblocks, which makes it possible to partition the current block usingblock information suitable for partitioning the block. As a result, itis possible to reduce the amount of coding pertaining to blockpartitioning information and improve compression efficiency.

For example, in the encoder according to this embodiment, the blockinformation retrieved may include at least one of information related toblock partition structure, information related to an intra predictionmode or an inter prediction mode, information related to an intraprediction direction, information related to a motion vector,information related to a reference picture, information related to aquantization parameter, and information related to a partitioning depth.

This makes it possible to use information appropriate as blockinformation, which makes it possible to partition the current blockusing the block information further suitable for block partitioning. Asa result, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory. Using the memory, the processor: parsesa parameter from a bitstream; selects at least one previously decodedblock from a plurality of previously decoded blocks using the parameterparsed; retrieves block information from the at least one previouslydecoded block selected; partitions a current block into a plurality ofsub blocks using the block information retrieved; and decodes a subblock included in the plurality of sub blocks in a decoding processincluding an inverse transform process and/or a prediction process.

This makes it possible to adaptively select a previously decoded blockto partition the current block, using the parameter. Partitioning ablock into a plurality of sub blocks using the block information for aselected previously decoded block makes it possible to reduce the amountof coding pertaining to block partitioning information and improvecompression efficiency.

For example, in the decoder according to this embodiment, the currentblock and the plurality of previously decoded blocks may be differentblocks, and at least one of the plurality of previously decoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to select a previously decoded block to partitiona block from among a plurality of mutually different previously decodedblocks, which makes it possible to partition the current block usingblock information suitable for partitioning the block. As a result, itis possible to reduce the amount of coding pertaining to blockpartitioning information and improve compression efficiency.

For example, in the decoder according to this embodiment, the blockinformation retrieved may include at least one of information related toblock partition structure, information related to an intra predictionmode or an inter prediction mode, information related to an intraprediction direction, information related to a motion vector,information related to a reference picture, information related to aquantization parameter, and information related to a partitioning depth.

This makes it possible to use information appropriate as blockinformation, which makes it possible to partition the current blockusing the block information further suitable for block partitioning. Asa result, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 13 and FIG. 14.

[Encoding Process]

FIG. 13 illustrates one example of a video encoding process according toEmbodiment 2.

As a first step S3001, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream. The written parameters include one or moreparameters for selecting one or more previously encoded block or blockinformation from a determined candidate list. The determined candidatelist may be predetermined.

Next, at step S3002, at least one previously encoded block is selectedfrom a plurality of previously encoded blocks using the writtenparameters. Where either at least one previously encoded block is fromthe same frame as the current block (for example, a neighbouring blockto current block) or at least one previously encoded block is fromanother frame which is different from the frame that contains thecurrent block (for example, a collocated block to the current block, ora motion compensated block whose position is obtained by using a motionvector of the current block, or the last encoded block from the latestencoded frame which is different from current frame).

At step S3003, block information is retrieved from the selected encodedblock.

A current block is then partitioned into a plurality of sub blocks usingthe retrieved block information at step S3004. FIG. 38 shows an exampleof partitioning the current block into a plurality of sub blocks usingthe retrieved block information.

To partition a block into sub blocks, the block partitioning informationfor the block is derived. Here, the block partitioning information isderived according to block information (for example, block partitionstructure, intra prediction or inter prediction mode, intra predictiondirection, motion vector, reference picture, quantization parameters,and partitioning depth) from previously encoded blocks. Using blockpartitioning information will result in partitioning a block into aplurality of sub blocks. As shown in FIG. 38, using different blockpartitioning information will result in partitioning a block into aplurality of sub blocks with different heights, widths, or shapes.

A block partition structure from a selected previously encoded block canbe directly used as the block partition structure for the current block.

Block partition structures from two or more selected previously encodedblocks can also be combined (for example, the top half uses the blockpartition structure from the top block and the left half uses the blockpartition structure from the left block as shown in FIG. 39) to derive anew block partition structure as the block partition structure for thecurrent block.

A block partition structure from a selected previously encoded block canalso be modified (for example, use block partition structure with lesspartition depth as shown in FIG. 40) to derive a new block partitionstructure as the block partition structure for the current block.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined.

Block partitioning information may differ based on intra predictiondirection information from selected previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra-prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, a block partitioning information including avertical split can be derived for the current block. Similarly, ifintra-prediction direction information from a left neighbouring block isdetermined to be a horizontal direction or close to a horizontaldirection, a block partitioning information including a horizontal splitcan be derived for the current block.

Block partitioning information may be a set of parameters that includean index to select one candidate partition structure from a determinedcandidate list of block partition structures. The determined candidatelist may be predetermined. Here, block partition structure visuallypresents geometries of all sub blocks in a block, as shown in

FIG. 38.

Block partitioning information may be derived according to intra/interprediction modes from selected previously encoded blocks. For example,when prediction modes from the selected encoded blocks are intraprediction mode, determined block partitioning information can bederived to partition a block into a plurality of sub blocks with smallerblock sizes. Moreover, for example, when prediction modes from theselected encoded blocks are inter prediction mode, other determinedblock partitioning information can be derived to partition a block intoa plurality of sub blocks with larger block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may also be derived according to motionvectors from selected previously encoded blocks. When a differencebetween the motion vectors from the selected encoded blocks and themotion vectors from current block is bigger than a determined threshold,determined block partitioning information can be derived to partition ablock into a plurality of sub blocks with smaller block sizes. On theother hand, when a difference between the motion vectors from theselected encoded blocks and the motion vectors from current block is notgreater than a determined threshold, other determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with larger block sizes. The determined thresholds and thedetermined block partitioning information may be predetermined.

Block partitioning information may be derived according to quantizationparameters from selected previously encoded blocks. For example, whenthe values of quantization parameters from the selected encoded blocksare smaller than a determined value, determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with smaller block sizes. Moreover, for example, when the valuesof quantization parameters from the selected encoded blocks are notsmaller than a determined value, other determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with larger block sizes. The determined values and the determinedblock partitioning information may be predetermined.

Block partitioning information may be derived according to referencepicture information from selected previously encoded blocks. Forexample, when reference pictures from the selected encoded blocks aretemporally near to the current image or when the reference pictures fromthe selected encoded blocks are similar to one another, determined blockpartitioning information can be derived to partition a block into aplurality of sub blocks with larger block sizes. When reference picturesfrom the selected encoded blocks are not near to the current image orwhen the reference pictures from the selected encoded blocks are notsimilar to one another, other determined block partitioning informationcan be derived to partition a block into a plurality of sub blocks withsmaller block sizes. The determined block partitioning information maybe predetermined.

Block partitioning information may be derived according to partitioningdepths from selected previously encoded blocks. For example, whenpartitioning depths from the selected encoded blocks are larger than adetermined value (for example, determined depth value equals to 4),determined block partitioning information can be derived to partition ablock into a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the selected encoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be derived to partition a block intoa plurality of sub blocks with larger block sizes. The determined valuesand the determined block partitioning information may be predetermined.

Block partitioning information may also be derived according to splitinformation from previously encoded blocks of a frame different than thecurrent frame. For example, block partitioning information (whichincludes split information) for current block, or the current block'ssplit information can be derived from block information of a previouslyencoded block (e.g., a collocated block, the last encoded block, or anencoded block identified by a motion vector) from an encoded frame whichis different from current frame.

At step S3005, a sub block from the plurality of sub blocks is encodedin an encoding process. Here, the encoding process includes a transformprocess and/or a prediction process. The transform process may beperformed on a per block basis similar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 14 illustrates one example of a video decoding process according toEmbodiment 2.

As a first step S4001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream. The parsed parameters include one or moreparameters for selecting one or more previously decoded block or blockinformation from a determined candidate list. The determined candidatelist may be predetermined.

Next, at step S4002, at least one previously decoded block is selectedfrom a plurality of previously decoded blocks using the parsedparameters. Where either at least one previously decoded block is fromthe same frame as the current block (for example, a neighbouring blockto current block) or at least one previously decoded block is fromanother frame which is different from the frame that contains thecurrent block (for example, a collocated block to current block, or amotion compensated block whose position is obtained using a motionvector of the current block, or the last decoded block from the latestdecoded frame which is different from current frame).

At step S4003, block information is retrieved from the selected decodedblock.

A current block is then partitioned into a plurality of sub blocks usingthe retrieved block information at step S4004. FIG. 38 shows an exampleof partitioning the current block into a plurality of sub blocks usingthe retrieved block information.

To partition a block into sub blocks, the block partitioning informationfor the block is derived. Here, the block partitioning information canbe derived according to block information (for example, block partitionstructure, intra prediction or inter prediction mode, intra predictiondirection, motion vector, reference picture, quantization parameters,and partitioning depth) from previously decoded blocks. Using blockpartitioning information will result in partitioning a block into aplurality of sub blocks. As shown in FIG. 38, using different blockpartitioning information will result in partitioning a block into aplurality of sub blocks with different heights, widths, or shapes.

A block partition structure from a selected previously decoded block canbe directly used as the block partition structure for the current block.

Block partition structures from two or more selected previously decodedblocks can be combined (for example, the top half uses the blockpartition structure from the top block and the left half uses the blockpartition structure from left block as shown in FIG. 39) to derive a newblock partition structure as the block partition structure for thecurrent block.

A block partition structure from a selected previously decoded block canalso be modified (for example, use block partition structure with lesspartition depth as shown in FIG. 40) to derive a new block partitionstructure as the block partition structure for the current block.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined.

Block partitioning information may differ based on intra predictiondirection information from selected previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra-prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, a block partitioning information including avertical split can be derived for the current block. Similarly, ifintra-prediction direction information from a left neighbouring block isdetermined to be a horizontal direction or close to a horizontaldirection, a block partitioning information including a horizontal splitcan be derived for the current block.

Block partitioning information may be a set of parameters that includean index to select one candidate partition structure from a determinedcandidate list of block partition structures. The determined candidatelist may be predetermined. Here, block partition structure visuallypresents geometries of all sub blocks in a block, as shown in FIG. 38.

Block partitioning information may be derived according to intra/interprediction modes from selected previously decoded blocks. For example,when prediction modes from the selected decoded blocks are intraprediction mode, determined block partitioning information can bederived to partition a block into a plurality of sub blocks with smallerblock sizes. Moreover, for example, when prediction modes from theselected decoded blocks are inter prediction mode, other determinedblock partitioning information can be derived to partition a block intoa plurality of sub blocks with larger block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may also be derived according to motionvectors from selected previously decoded blocks. When a differencebetween the motion vectors from the selected decoded blocks and themotion vectors from current block is bigger than a determined threshold,determined block partitioning information can be derived to partition ablock into a plurality of sub blocks with smaller block sizes. On theother hand, when a difference between the motion vectors from theselected decoded blocks and the motion vectors from current block is notgreater than a determined threshold, other determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with larger block sizes. The determined thresholds and thedetermined block partitioning information may be predetermined.

Block partitioning information may be derived according to quantizationparameters from selected previously decoded blocks. For example, whenthe values of quantization parameters from the selected decoded blocksare smaller than a determined value, determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with smaller block sizes. Moreover, for example, when the valuesof quantization parameters from the selected decoded blocks are notsmaller than a determined value, other determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with larger block sizes. The determined values and the determinedblock partitioning information may be predetermined.

Block partitioning information may be derived according to referencepicture information from selected previously decoded blocks. Forexample, when reference pictures from the decoded blocks are temporallynear to the current image or when the reference pictures from thedecoded blocks are similar to one another, determined block partitioninginformation can be derived to partition a block into a plurality of subblocks with larger block sizes. When reference pictures from the decodedblocks are not near to the current image or when the reference picturesfrom the decoded blocks are not similar to one another, other determinedblock partitioning information can be derived to partition a block intoa plurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be derived according to partitioningdepths from selected previously decoded blocks. For example, whenpartitioning depths from the selected decoded blocks are larger than adetermined value (for example, determined depth value equals to 4),determined block partitioning information can be derived to partition ablock into a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the selected decoded blocks are not larger thana determined value (for example, depth equals to 2), other determinedblock partitioning information can be derived to partition a block intoa plurality of sub blocks with larger block sizes. The determined valuesand the determined block partitioning information may be predetermined.

Block partitioning information may also be predicted according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be derived from blockinformation of a previously decoded block (e.g., a collocated block, thelast decoded block or a decoded block identified by a motion vector)from a decoded frame which is different from current frame.

At step S4005, a sub block from the plurality of sub blocks is decodedin a decoding process. Here, the decoding process includes an inversetransform process and/or a prediction process. The inverse transformprocess may be performed on a per block basis similar to the sub blocksize.

[Decoder]

The structure of the video/image decoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 3 [Outline]

An encoder according to this embodiment encodes a block of an image. Theencoder includes a processor and memory connected to the processor.Using the memory, the processor: initializes block partitioninginformation, wherein using the block partitioning informationinitialized will result in partitioning a block into a plurality of subblocks of a first set of geometries; writes a parameter into abitstream; modifies the block partitioning information initialized intomodified block partitioning information using the parameter written,wherein using the modified block partitioning information will result inpartitioning a block into a plurality of sub blocks of a set ofgeometries which is different from the first set of geometries; modifiesgeometries of a plurality of sub blocks using the modified blockpartitioning information; and encodes a sub block included in theplurality of sub blocks in an encoding process including a transformprocess and/or a prediction process.

This makes it possible to adaptively modify the initialized blockpartitioning information to modified block partitioning information,using a parameter. The geometries of a plurality of sub blocks can bemodified using this modified block partitioning information. As aresult, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the encoder according to this embodiment, a process toinitialize the block partitioning information may include a process ofselecting block partitioning information from a determined list of blockpartitioning information. The determined list may be predetermined.

This makes it possible to initialize block partitioning information byselecting block partitioning information from a determined list.Accordingly, information identifying block partitioning information inthe list may be included in block partitioning information, and it ispossible to reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency.

For example, in the encoder according to this embodiment, a process toinitialize the block partitioning information may include a process ofgenerating block partitioning information using a determined parameterrelated to a geometry. The determined parameter may be predetermined.

This makes it possible to initialize block partitioning information bygenerating block partitioning information using a parameter.

For example, in the encoder according to this embodiment, a process toinitialize the block partitioning information may include determining apartitioning depth based on at least one of a picture type of a currentblock and a quantization parameter.

This makes it possible to determine a partition depth based on thepicture type of the current block and/or quantization parameters inblock partitioning information initialization. Accordingly, it ispossible to determine partition depth based on information existing inthe bitstream, and reduce the amount of coding pertaining to blockpartitioning information. Furthermore, by using the picture type of thecurrent block and/or quantization parameters, it is possible toinitialize block partitioning information at a partition depth suitablefor the current block, which improves compression efficiency.

For example, in the encoder according to this embodiment, the parameterwritten may include a difference between a partition depth indicated bythe block partitioning information initialized and a partition depthindicated by the modified block partitioning information.

This makes it possible to modify block partition depth using aparameter, which makes it possible to use sub blocks more suitable forencoding. As a result, it is possible to improve compression efficiency.

A decoder according to this embodiment decodes a block of an image. Thedecoder includes a processor and memory connected to the processor.Using the memory, the processor: initializes block partitioninginformation, wherein using the block partitioning informationinitialized will result in partitioning a block into a plurality of subblocks of a first set of geometries; parses a parameter from abitstream; modifies the block partitioning information initialized intomodified block partitioning information using the parameter parsed,wherein using the modified block partitioning information will result inpartitioning a block into a plurality of sub blocks of a set ofgeometries which is different from the first set of geometries; modifiesgeometries of a plurality of sub blocks using the modified blockpartitioning information; and decodes a sub block included in theplurality of sub blocks in a decoding process including an inversetransform process and/or a prediction process.

This makes it possible to adaptively modify the initialized blockpartitioning information to modified block partitioning information,using a parameter. The geometries of a plurality of sub blocks can bemodified using this modified block partitioning information. As aresult, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the decoder according to this embodiment, a process toinitialize the block partitioning information may include a process ofselecting block partitioning information from a determined list of blockpartitioning information. The determined list may be predetermined.

This makes it possible to initialize block partitioning information byselecting block partitioning information from a determined list.Accordingly, information identifying block partitioning information inthe list may be included in block partitioning information, and it ispossible to reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency.

For example, in the decoder according to this embodiment, a process toinitialize the block partitioning information may include a process ofgenerating block partitioning information using a determined parameterrelated to a geometry. The determined parameter may be predetermined.

This makes it possible to initialize block partitioning information bygenerating block partitioning information using a parameter.

For example, in the decoder according to this embodiment, a process toinitialize the block partitioning information may include determining apartitioning depth based on at least one of a picture type of a currentblock and a quantization parameter.

This makes it possible to determine a partition depth based on thepicture type of the current block and/or quantization parameters inblock partitioning information initialization. Accordingly, it ispossible to determine partition depth based on information existing inthe bitstream, and reduce the amount of coding pertaining to blockpartitioning information. Furthermore, by using the picture type of thecurrent block and/or quantization parameters, it is possible toinitialize block partitioning information at a partition depth suitablefor the current block, which improves compression efficiency.

For example, in the decoder according to this embodiment, the parameterparsed may include a difference between a partition depth indicated bythe block partitioning information initialized and a partition depthindicated by the modified block partitioning information.

This makes it possible to modify block partition depth using aparameter, which makes it possible to use sub blocks more suitable forencoding. As a result, it is possible to improve compression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 15 and FIG. 16.

[Encoding Process]

FIG. 15 illustrates one example of a video encoding process according toEmbodiment 3.

As a first step S5001, block partitioning information is initialized.Using the initialized block partitioning information (hereinafter“initial block partitioning information”) will result in partitioning ablock into a plurality of sub blocks of a first set of geometries. Asshown in FIG. 38, using different block partitioning information willresult in partitioning a block into a plurality of sub blocks withdifferent heights, widths, or shapes.

Block partition structure from a previously encoded block can bedirectly used as the initialized block partition structure for thecurrent block.

Block partition structures from two or more previously encoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the initialized block partition structure for thecurrent block. One example of how to select previously encoded blocks isto select encoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously encoded blocks that were encodedusing inter prediction will be selected.

Block partition structure from a previously encoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe initialized block partition structure for the current block.

Initial block partitioning information may be a set of parameters thatindicate whether a block is horizontally split or vertically split.Initial block partitioning information may also be a set of parametersthat include a determined block width and a determined block height forall sub blocks in a block. The determined block width and the determinedblock height may be predetermined.

Initial block partitioning information may differ based on intraprediction direction information from previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, block partitioning information for the currentblock can be initialized to block partitioning information including avertical split. Similarly, if intra-prediction direction informationfrom a left neighbouring block is determined to be a horizontaldirection or close to a horizontal direction, block partitioninginformation for the current block can be initialized to a blockpartitioning information including a horizontal split.

Initial block partitioning information may be a set of parameters thatinclude an index to select one candidate partition structure from adetermined candidate list of block partition structures. The determinedlist may be predetermined. Here, initialized block partition structurevisually presents geometries of all sub blocks in a block, as shown inFIG. 38.

Block partitioning information can be initialized according tointra/inter prediction modes from previously encoded blocks. Forexample, when prediction modes from the encoded blocks are intraprediction mode, block partitioning information can be initialized todetermined block partitioning information for partitioning a block intoa plurality of sub blocks with smaller block sizes. Moreover, forexample, when prediction modes from the encoded blocks are interprediction mode, block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information may also be initialized according tomotion vectors from previously encoded blocks. For example, when adifference between the motion vectors from the encoded blocks and themotion vectors from current block is bigger than a determined threshold,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. On the other hand, when adifference between the motion vectors from the encoded blocks and themotion vectors from current block is not greater than a determinedthreshold, the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedthresholds and the determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according toquantization parameters from previously encoded blocks. For example,when the values of quantization parameters from the encoded blocks aresmaller than a determined value, the block partitioning information canbe initialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. Moreover, for example, when the values of quantization parametersfrom the encoded blocks are not smaller than a determined value, theblock partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined values and thedetermined block partitioning information may be predetermined.

Block partitioning information may be initialized according to referencepicture information from previously encoded blocks. For example, whenreference pictures from the encoded blocks are temporally near to thecurrent image or when the reference pictures from the encoded blocks aresimilar to one another, the block partitioning information can beinitialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with larger blocksizes. When reference pictures from the encoded blocks are not near tothe current image or when the reference pictures from the encoded blocksare not similar to one another, the block partitioning information canbe initialized to other determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. The determined block partitioning information may bepredetermined. Block partitioning information may be initializedaccording to partitioning depths from previously encoded blocks. Forexample, when partitioning depths from the encoded blocks are largerthan a determined value (for example, determined depth value equals to4), the block partitioning information can be initialized to determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with smaller block sizes. When partitioning depths fromthe encoded blocks are not larger than determined value (for example,depth equals to 2), the block partitioning information can beinitialized to other determined block partitioning information forpartitioning a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may also be initialized according tosplit information from previously encoded blocks of a frame differentthan the current frame. For example, block partitioning information(which includes split information) for the current block, or the currentblock's split information can be initialized from a previously encodedblock (e.g., a collocated block, the last encoded block or an encodedblock identified by a motion vector) from an encoded frame which isdifferent from current frame.

Next, at step S5002, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream.

At step S5003, the initial block partitioning information is thenmodified into modified block partitioning information using the writtenparameters. Here, using the modified block partitioning information willresult in partitioning a block into a plurality of sub blocks of a setof geometries which is different as the first set of geometries. Thewritten parameters include one or more parameters for modifying initialblock partitioning information into modified block partitioninginformation.

For example, the written parameters can include a split flag to split ablock into a plurality of sub blocks. As shown in FIG. 42A, using theparameters will change the value of the quad-tree (QT) split flag andmodifies the initialized block partition structure.

For another example, the written parameters can include merge flags tohierarchically merge smaller blocks into bigger blocks based on adetermined scanning order (e.g., raster-scan or z-scan). The determinedscanning order may be predetermined. As shown in FIG. 42B, using theparameters will merge a plurality of blocks into a bigger block andcauses the initialized block partition structure modified. An example ofhierarchically merging smaller blocks into bigger blocks is shown inFIG. 43.

For another example, the written parameters can include split enableflags to hierarchically split bigger blocks into smaller blocks based ona determined scanning order (e.g., raster-scan or z-scan). Thedetermined scanning order may be predetermined. As shown in FIG. 42C,using the parameters will split a block into a plurality of smaller subblocks and will modify the initialized block partition structure.

For another example, the written parameters can include a differencebetween the partition depth indicated by the initial block partitioninginformation and the partition depth indicated by the modified blockpartitioning information. Using the parameter swill modify the blockpartition depth.

The combination of different partitioning methods such as splitting ablock and merging smaller blocks to create the final block partitionstructure is also possible. Control parameters which include one or moreswitch parameter(s) or flag(s) to indicate whether a merge enable flagor a split enable flag is used, can be included in a header of thebitstream.

Using initial block partitioning information or modified blockpartitioning information will result in different block partitionstructures based on different partitioning methods. The partitioningmethods, for example, can be a binary split as shown by b1) and b2) inFIG. 41, a quad-tree split as shown by q1) and q2) in FIG. 41, amultiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

The written parameters, for example, can also indicate if nomodification is needed. If no modification is needed, steps S5003 andS5004 can be skipped. Correspondingly, a block will be partitioned intoa plurality of sub blocks using the initial block partitioninginformation before going to step S5005. At step S5005, encoding in anencoding process of a sub block from said plurality of sub blockspartitioned using modified block partitioning information will bereplaced by encoding in an encoding process of a sub block from saidplurality of sub blocks partitioned using initial block partitioninginformation.

The geometries of a plurality of sub blocks are modified using themodified block partitioning information at S5004.

At step S5005, a sub block from said plurality of sub blocks is encodedin an encoding process. Here, the encoding process includes a transformprocess and/or a prediction process. The transform process may beperformed on a per block basis similar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 16 illustrates one example of a video decoding process according toEmbodiment 3.

As a first step S6001, block partitioning information is initialized.Using the initial block partitioning information will result inpartitioning a block into a plurality of sub blocks of a first set ofgeometries. As shown in FIG. 38, using different block partitioninginformation will result in partitioning a block into a plurality of subblocks with different heights, widths, or shapes.

Block partition structure from a previously decoded block can bedirectly used as the initialized block partition structure for thecurrent block.

Block partition structures from two or more previously decoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the initialized block partition structure for thecurrent block. One example of how to select previously decoded blocks isto select decoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously decoded blocks that were decodedusing inter prediction will be selected.

Block partition structure from a previously decoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe initialized block partition structure for the current block.

Initial block partitioning information may be a set of parameters thatindicate whether a block is horizontally split or vertically split.Initial block partitioning information may also be a set of parametersthat include a determined block width and a determined block height forall sub blocks in a block. The determined block width and the determinedblock height may be predetermined.

Initial block partitioning information may differ based on intraprediction direction information from previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, block partitioning information for the currentblock can be initialized to block partitioning information including avertical split. Similarly, if intra-prediction direction informationfrom a left neighbouring block is determined to be a horizontaldirection or close to a horizontal direction, block partitioninginformation for the current block can be initialized to a blockpartitioning information including a horizontal split.

Initial block partitioning information may be a set of parameters thatinclude an index to select one candidate partition structure from adetermined candidate list of block partition structures. The determinedcandidate list may be predetermined. Here, initialized block partitionstructure visually presents geometries of all sub blocks in a block, asshown in FIG. 38.

Block partitioning information can be initialized according tointra/inter prediction modes from previously decoded blocks. Whenprediction modes from the decoded blocks are intra prediction mode,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. Moreover, for example, whenprediction modes from the decoded blocks are inter prediction mode,block partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined block partitioninginformation may be predetermined.

Block partitioning information may also be initialized according tomotion vectors from previously decoded blocks. For example, when adifference between the motion vectors from the decoded blocks and themotion vectors from current block is bigger than a determined threshold,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. On the other hand, when adifference between the motion vectors from the decoded blocks and themotion vectors from current block is not greater than a determinedthreshold, the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedthresholds and the determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according toquantization parameters from previously decoded blocks. For example,when the values of quantization parameters from the decoded blocks aresmaller than a determined value, the block partitioning information canbe initialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. Moreover, for example, when the values of quantization parametersfrom the decoded blocks are not smaller than a determined value, theblock partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined values and thedetermined block partitioning information may be predetermined.

Block partitioning information may be initialized according to referencepicture information from previously decoded blocks. For example, whenreference pictures from the decoded blocks are temporally near to thecurrent image or when the reference pictures from the decoded blocks aresimilar to one another, the block partitioning information can beinitialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with larger blocksizes. When reference pictures from the decoded blocks are not near tothe current image or when the reference pictures from the decoded blocksare not similar to one another, the block partitioning information canbe initialized to other determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. The determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according topartitioning depths from previously decoded blocks. For example, whenpartitioning depths from the decoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), the blockpartitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. When partitioning depths from thedecoded blocks are not larger than determined value (for example, depthequals to 2), the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be initialized according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be initialized from apreviously decoded block (e.g., a collocated block, the last decodedblock or a decoded block identified by a motion vector) from a decodedframe which is different from current frame.

Next, at step S6002, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream.

At step S6003, the initial block partitioning information is thenmodified into modified block partitioning information using the parsedparameters. Here, using the modified block partitioning information willresult in partitioning a block into a plurality of sub blocks of a setof geometries which is different as the first set of geometries. Theparsed parameters include one or more parameters for modifying initialblock partitioning information into modified block partitioninginformation.

For example, the parsed parameters can include a split flag to split ablock into a plurality of sub blocks. As shown in FIG. 42A, using theparameters will change the value of the quad-tree (QT) split flag andmodifies the initialized block partition structure.

For another example, the parsed parameters can include merge flags tohierarchically merge smaller blocks into bigger blocks based on adetermined scanning order (e.g., raster-scan or z-scan). The determinedscanning order may be predetermined. As shown in FIG. 42B, using theparameters will merge a plurality of blocks into a bigger block andcauses the initialized block partition structure modified. An example ofhierarchically merging smaller blocks into bigger blocks is shown inFIG. 43.

For another example, the parsed parameters can include split enableflags to hierarchically split bigger blocks into smaller blocks based ondetermined scanning order (e.g., raster-scan or z-scan). As shown inFIG. 42C, using the parameters will split a block into a plurality ofsmaller sub blocks and will modify the initialized block partitionstructure. The determined scanning order may be predetermined.

For another example, the parsed parameters can include a differencebetween the partition depth indicated by the initial block partitioninginformation and the partition depth indicated by the modified blockpartitioning information. Using the parameter swill modify the blockpartition depth.

The combination of different partitioning methods such as splitting ablock and merging smaller blocks to create the final block partitionstructure is also possible. Control parameters which include one or moreswitch parameter(s) or flag(s) to indicate whether a merge enable flagor a split enable flag is used, can be included in a header of thebitstream.

Using initial block partitioning information or modified blockpartitioning information will result in different block partitionstructures based on different partitioning methods. The partitioningmethods, for example, can be a binary split as shown by bl) and b2) inFIG. 41, a quad-tree split as shown by q1) and q2) in FIG. 41, amultiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

The parsed parameters, for example, can also indicate if no modificationis needed. If no modification is needed, steps S6003 and S6004 can beskipped. Correspondingly, a block will be partitioned into a pluralityof sub blocks using the initial block partitioning information beforegoing to step S6005. At step S6005, decoding in a decoding process of asub block from said plurality of sub blocks partitioned using modifiedblock partitioning information will be replaced by decoding in adecoding process of a sub block from said plurality of sub blockspartitioned using initial block partitioning information.

The geometries of a plurality of sub blocks are modified using themodified block partitioning information at S6004.

At step S6005, a sub block from the plurality of sub blocks is decodedin a decoding process. Here, the decoding process includes an inversetransform process and/or a prediction process. The inverse transformprocess may be performed on a per block basis similar to the sub blocksize.

[Decoder]

The structure of the video/image decoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Note that in this embodiment, default block partitioning information maybe used as initial block partitioning information. For example, thedefault block partitioning information is defined block partitioninginformation. For example, the default block partitioning information maybe block partitioning information that is defined in a standard.Moreover, for example, the default block partitioning information may beblock partitioning information that is written in a header for ahigher-level element than the block. Note that when default blockpartitioning information is used, in steps S5001 and S6001, obtaining ofthe default block partitioning information is performed instead of theinitializing of the block partitioning information. The defined blockpartitioning information may be predefined.

Note that in this embodiment, initialization based on block informationfor a previously encoded or decoded block is given as an example ofblock partitioning information initialization, but the blockpartitioning information initialization is not limited to this example.For example, in the block partitioning information initialization,partition depth may be determined based on at least one of the picturetype (I, P, or B picture) of the current block and quantizationparameters of the current block.

More specifically, for example, when the current block is an I picturetype, the block partitioning information may be initialized to blockpartitioning information for partitioning a block at a relatively deeppartitioning depth. Moreover, for example, when the current block is a Por B picture type, the block partitioning information may be initializedto block partitioning information for partitioning a block at arelatively shallow partitioning depth.

Moreover, for example, the partitioning depth in the initial blockpartitioning information may be determined based on quantizationparameters of the current block. More specifically, when a quantizationparameter of the current block is less than a determined value, theblock partitioning information may be initialized to block partitioninginformation for partitioning a block at a relatively deep partitioningdepth. Moreover, for example, when a quantization parameter of thecurrent block is greater than or equal to a determined value, the blockpartitioning information may be initialized to block partitioninginformation for partitioning a block at a relatively shallowpartitioning depth. The determined value may be predetermined.

Embodiment 4 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; partitions ablock into a plurality of sub blocks; merges at least two sub blocksincluded in the plurality of sub blocks into a merged block using theparameter written; and encodes the merged block in an encoding processincluding a transform process and/or a prediction process.

This makes it possible to combine at least two sub blocks using aparameter. Accordingly, it is possible to modify the partitioning of thecurrent block using the parameter, which makes it possible to use subblocks more suitable for encoding. As a result, it is possible toimprove compression efficiency.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: parses a parameter from a bitstream; partitions ablock into a plurality of sub blocks; merges at least two sub blocksincluded in the plurality of sub blocks into a merged block using theparameter parsed; and decodes the merged block in a decoding processincluding an inverse transform process and/or a prediction process.

This makes it possible to combine at least two sub blocks using aparameter. Accordingly, it is possible to modify the partitioning of thecurrent block using the parameter, which makes it possible to use subblocks more suitable for decoding. As a result, it is possible toimprove compression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 17 and FIG. 18.

[Encoding Process]

FIG. 17 illustrates one example of a video encoding process according toEmbodiment 4.

As a first step S7001, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S7002, a block is partitioned into a plurality of subblocks using initial block partitioning information. As shown in FIG.38, using different block partitioning information will result inpartitioning a block into a plurality of sub blocks with differentheights, widths, or shapes.

Block partition structure from a previously encoded block can bedirectly used as the initialized block partition structure for thecurrent block. Moreover, default block partition structure can be usedas the initialized block partition structure for the current block.

Block partition structures from two or more previously encoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the initialized block partition structure for thecurrent block. One example of how to select previously encoded blocks isto select encoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously encoded blocks that were encodedusing inter prediction will be selected.

Block partition structure from a previously encoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe initialized block partition structure for the current block.

Initial block partitioning information may be a set of parameters thatindicate whether a block is horizontally split or vertically split.Initial block partitioning information may also be a set of parametersthat include a determined block width and a determined block height forall sub blocks in a block. The determined block width and the determinedblock height may be predetermined.

Initial block partitioning information may differ based on intraprediction direction information from previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, block partitioning information for the currentblock can be initialized to block partitioning information including avertical split. Similarly, if intra-prediction direction informationfrom a left neighbouring block is determined to be a horizontaldirection or close to a horizontal direction, block partitioninginformation for the current block can be initialized to a blockpartitioning information including a horizontal split.

Initial block partitioning information may be a set of parameters thatinclude an index to select one candidate partition structure from adetermined candidate list of block partition structures. Here,initialized block partition structure visually presents geometries ofall sub blocks in a block, as shown in FIG. 38. The determined candidatelist may be predetermined.

Block partitioning information can be initialized according tointra/inter prediction modes from previously encoded blocks. Forexample, when prediction modes from the encoded blocks are intraprediction mode, block partitioning information can be initialized todetermined block partitioning information for partitioning a block intoa plurality of sub blocks with smaller block sizes. Moreover, forexample, when prediction modes from the encoded blocks are interprediction mode, block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information may also be initialized according tomotion vectors from previously encoded blocks. For example, when adifference between the motion vectors from the encoded blocks and themotion vectors from current block is bigger than a determined threshold,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. On the other hand, when adifference between the motion vectors from the encoded blocks and themotion vectors from current block is not greater than a determinedthreshold, the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedthresholds and the determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according toquantization parameters from previously encoded blocks. For example,when the values of quantization parameters from the encoded blocks aresmaller than a determined value, the block partitioning information canbe initialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. Moreover, for example, when the values of quantization parametersfrom the encoded blocks are not smaller than a determined value, theblock partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined values and thedetermined block partitioning information may be predetermined.

Block partitioning information may be initialized according to referencepicture information from previously encoded blocks. For example, whenreference pictures from the encoded blocks are temporally near to thecurrent image or when the reference pictures from the encoded blocks aresimilar to one another, the block partitioning information can beinitialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with larger blocksizes. When reference pictures from the encoded blocks are not near tothe current image or when the reference pictures from the encoded blocksare not similar to one another, the block partitioning information canbe initialized to other determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. The determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according topartitioning depths from previously encoded blocks. For example, whenpartitioning depths from the encoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), the blockpartitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. When partitioning depths from theencoded blocks are not larger than determined value (for example, depthequals to 2), the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be initialized according tosplit information from previously encoded blocks of a frame differentthan the current frame. For example, block partitioning information(which includes split information) for the current block, or the currentblock's split information can be initialized from a previously encodedblock (e.g., a collocated block, the last encoded block or an encodedblock identified by a motion vector) from an encoded frame which isdifferent from current frame.

At step S7003, at least two sub blocks from the plurality of sub blocksis merged into a merged block using the written parameters. For example,the written parameters can include merge flags to hierarchically mergesmaller blocks into bigger blocks based on a determined scanning order(e.g., raster-scan or z-scan). As shown in FIG. 42B, using theparameters will merge a plurality of blocks into a bigger block andcauses the initialized block partition structure modified. An example ofhierarchically merging smaller blocks into bigger blocks is shown inFIG. 43. The determined scanning order may be predetermined.

Different partitioning methods can be used to derive block partitionstructures before and after the merging process at step S7003. Thepartitioning methods, for example, can be a binary split as shown by b1)and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) in FIG.41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

The written parameters, for example, can also indicate that no mergingis needed. If no merging is needed, S7003 can be skipped.Correspondingly, a block will be partitioned into a plurality of subblocks using the initial block partitioning information before going tostep S7004. At step S7004, a sub block instead of the merged block isencoded in an encoding process.

At step S7004, the merged block is encoded in an encoding process. Here,the encoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 18 illustrates one example of a video decoding process according toEmbodiment 4.

As a first step S8001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S8002, a block is partitioned into a plurality of subblocks using initial block partitioning information. As shown in FIG.38, using different block partitioning information will result inpartitioning a block into a plurality of sub blocks with differentheights, widths, or shapes.

Block partition structure from a previously decoded block can bedirectly used as the initialized block partition structure for thecurrent block.

Block partition structures from two or more previously decoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the initialized block partition structure for thecurrent block. One example of how to select previously decoded blocks isto select decoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously decoded blocks that were decodedusing inter prediction will be selected.

Block partition structure from a previously decoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe initialized block partition structure for the current block.

Initial block partitioning information may be a set of parameters thatindicate whether a block is horizontally split or vertically split.Initial block partitioning information may be a set of parameters thatinclude a determined block width and a determined block height for allsub blocks in a block. The determined block width and the determinedblock height may be predetermined.

Initial block partitioning information may differ based on intraprediction direction information from previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations can be used to determine whether thecurrent block is to be split vertically or horizontally into smallerblocks. For example, when intra prediction direction information from atop neighbouring block is determined to be a vertical direction or closeto vertical direction, block partitioning information for the currentblock can be initialized to block partitioning information including avertical split. Similarly, if intra-prediction direction informationfrom a left neighbouring block is determined to be a horizontaldirection or close to a horizontal direction, block partitioninginformation for the current block can be initialized to a blockpartitioning information including a horizontal split.

Initial block partitioning information may be a set of parameters thatinclude an index to select one candidate partition structure from adetermined candidate list of block partition structures. Here,initialized block partition structure visually presents geometries ofall sub blocks in a block, as shown in FIG. 38. The determined candidatelist may be predetermined.

Block partitioning information can be initialized according tointra/inter prediction modes from previously decoded blocks. Whenprediction modes from the decoded blocks are intra prediction mode,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. Moreover, for example, whenprediction modes from the decoded blocks are inter prediction mode,block partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined block partitioninginformation may be predetermined.

Block partitioning information may also be initialized according tomotion vectors from previously decoded blocks. For example, when adifference between the motion vectors from the decoded blocks and themotion vectors from current block is bigger than a determined threshold,block partitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. On the other hand, when adifference between the motion vectors from the decoded blocks and themotion vectors from current block is not greater than a determinedthreshold, the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedthresholds and the determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according toquantization parameters from previously decoded blocks. For example,when the values of quantization parameters from the decoded blocks aresmaller than a determined value, the block partitioning information canbe initialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. Moreover, for example, when the values of quantization parametersfrom the decoded blocks are not smaller than a determined value, theblock partitioning information can be initialized to other determinedblock partitioning information for partitioning a block into a pluralityof sub blocks with larger block sizes. The determined values and thedetermined block partitioning information may be predetermined.

Block partitioning information may be initialized according to referencepicture information from previously decoded blocks. For example, whenreference pictures from the decoded blocks are temporally near to thecurrent image or when the reference pictures from the decoded blocks aresimilar to one another, the block partitioning information can beinitialized to determined block partitioning information forpartitioning a block into a plurality of sub blocks with larger blocksizes. When reference pictures from the decoded blocks are not near tothe current image or when the reference pictures from the decoded blocksare not similar to one another, the block partitioning information canbe initialized to other determined block partitioning information forpartitioning a block into a plurality of sub blocks with smaller blocksizes. The determined block partitioning information may bepredetermined.

Block partitioning information may be initialized according topartitioning depths from previously decoded blocks. For example, whenpartitioning depths from the decoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), the blockpartitioning information can be initialized to determined blockpartitioning information for partitioning a block into a plurality ofsub blocks with smaller block sizes. When partitioning depths from thedecoded blocks are not larger than determined value (for example, depthequals to 2), the block partitioning information can be initialized toother determined block partitioning information for partitioning a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be initialized according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be initialized from apreviously decoded block (e.g., a collocated block, the last decodedblock or a decoded block identified by a motion vector) from a decodedframe which is different from current frame.

At step S8003, at least two sub blocks from the plurality of sub blocksis merged into a merged block using the parsed parameters. For example,the parsed parameters can include merge flags to hierarchically mergesmaller blocks into bigger blocks based on determined scanning order(e.g., raster-scan or z-scan). As shown in FIG. 42B, using theparameters will merge a plurality of blocks into a bigger block andcauses the initialized block partition structure modified. An example ofhierarchically merging smaller blocks into bigger blocks is shown inFIG. 43. The determined scanning order may be predetermined.

Different partitioning methods can be used to derive block partitionstructures before and after the merging process at step S8003. Thepartitioning methods, for example, can be a binary split as shown by b1)and b2) in FIG. 41, a quad-tree split as shown by q1) and q2) in FIG.41, a multiple cut/split as shown by m1) and m2) in FIG. 41, or a nonsquare/rectangle split as shown by n1) in FIG. 41. The geometries (shapeand/or size) of different sub blocks can be different such as theasymmetrical binary split as shown by b2) in FIG. 41, an asymmetricalquad-tree split as shown by q2) in FIG. 41, a non-equal sizemultiple-cut as shown by m1) in FIG. 41, or a non square/rectangle splitas shown by n1) in FIG. 41.

The parsed parameters, for example, can also indicate if no merging isneeded. If no merging is needed, S8003 can be skipped. Correspondingly,a block will be partitioned into a plurality of sub blocks using theinitial block partitioning information before going to step S8004. Atstep S8004, a sub block instead of the merged block is decoded in adecoding process.

At step S8004, a merged block is decoded in a decoding process. Here,the decoding process includes an inverse transform process and/or aprediction process. The transform process may be performed on a perblock basis similar to the sub block size.

[Decoder]

The structure of the video/image decoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 5 [Outline]

An encoder according to one aspect of the present disclosure encodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor: retrieves a geometry of ablock; determines whether the geometry retrieved is equal to adetermined geometry; when the geometry retrieved is equal to thedetermined geometry, partitions the block into a determined number ofsub blocks of a first set of geometries; when the geometry retrieved isnot equal to the determined geometry, partitions the block into thedetermined number of sub blocks of another set of geometries which isdifferent from the first set of geometries; and encodes a sub block inan encoding process including a transform process and/or a predictionprocess. The determined geometry and the determined numbers of subblocks may be predetermined.

This makes it possible to partition a block based on the geometry of theblock. Accordingly, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency. Furthermore, usage of block geometry can contribute to thegeneration of sub blocks suitable more for encoding and to theimprovement in compression efficiency.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the encoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to obtain sub blocks in sizes suitable for encoding, andimprove compression efficiency.

A decoder according to one aspect of the present disclosure decodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor: retrieves a geometry of ablock; determines whether the geometry retrieved is equal to adetermined geometry; when the geometry retrieved is equal to thedetermined geometry, partitions the block into a determined number ofsub blocks of a first set of geometries; when the geometry retrieved isnot equal to the determined geometry, partitions the block into thedetermined number of sub blocks of another set of geometries which isdifferent from the first set of geometries; and decodes a sub block in adecoding process including an inverse transform process and/or aprediction process. The determined geometry and the determined numbersof sub blocks may be predetermined.

This makes it possible to partition a block based on the geometry of theblock. Accordingly, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency. Furthermore, usage of block geometry can contribute to thegeneration of sub blocks suitable more for encoding and to theimprovement in compression efficiency.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the decoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to use sub blocks in sizes suitable for decoding, and improvecompression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 19 and FIG. 20.

[Encoding Process]

FIG. 19 illustrates one example of a video encoding process according toEmbodiment 5.

As a first step S9001, geometries of a block are retrieved. Here,geometry indicates at least a shape, or a height, or a width of a block.As shown in FIG. 44, using different geometries will result inpartitioning a block into a plurality of sub blocks with differentshape, or block height, or block width.

Next, at step S9002, whether the retrieved geometries are equal todetermined geometries is determined. The determined geometries may bepredetermined.

If the retrieved geometries are equal to the determined geometries (Y inS9002), the block is partitioned into a determined number of sub blocksof first set of geometries at step S9003. If the retrieved geometriesare not equal to the determined geometries (N in S9002), the block ispartitioned into the determined number of sub blocks of another set ofgeometries which is different from the first set of geometries at stepS9004. The determined geometries and the determined numbers of subblocks may be predetermined.

For example, when the determined number of sub blocks is set to 2, forexample, as shown in (a1) in FIG. 45A, the block can be vertically splitinto 2 sub blocks with a 1:3 or 3:1 ratio when block width (e.g., 32) isa power of two. On the other hand, as shown in (a2) in FIG. 45A, theblock can be vertically split into 2 sub blocks with a 1:2 or 1:2 ratiowhen the width (e.g., 24) is not a power of two. Similarly, a block canbe horizontally split into two sub blocks according to whether the blockheight of the block is a power of two.

As another example, as shown in (c1) in FIG. 45C, when the determinednumber of sub blocks is set to 2, the block can be horizontally splitinto 2 sub blocks with equal size if block width (e.g., 8) is smallerthan block height (e.g., 32). On the other hand, as shown in (c2) inFIG. 45C, the block can be vertically split into 2 sub blocks with equalsize if the width (e.g., 32) is larger than block height (e.g., 8).

When the determined number of sub blocks is set to 4, for example, asshown in (b1) in FIG. 45B, the block can be split into 4 sub blockswhere the width of the largest sub block is 3 times the width of thesmallest sub block when block width (e.g., 32) of the block is a powerof two. On the other hand, as shown in (b2) FIG. 45B, the block can besplit into 4 sub blocks where the width of the largest sub block is 2times the width of the smallest sub block when block width (e.g., 24) ofthe block is not a power of two.

As another example, when the determined number of sub blocks is set to4, as shown in (dl) in FIG. 45D, when block width (e.g., 32) of a blockis the same as block height (e.g., 32) of the block, the block can beequally split at both vertical and horizontal directions. When blockwidth (e.g., 32) of the block is four times block height of the block(e.g., 8), as shown in (d2) in FIG. 45D, the block can be equally splitat vertical direction. Similarly, when block height (e.g., 32) of theblock is four times block width of the block (e.g., 8), the block can beequally split at horizontal direction.

As illustrated in FIG. 45A through FIG. 45D, in this embodiment, atleast one of sub block height and width is a power of 2. Note that thesub block height and/or width need not be limited to a power of 2.

At step S9005, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 20 illustrates one example of a video decoding process according toEmbodiment 5.

As a first step S10001, geometries of a block are retrieved. Here,geometry indicates at least a shape, or a height, or a width of a block.As shown in FIG. 44, using different geometries will result inpartitioning a block into a plurality of sub blocks with differentshape, or block height, or block width.

Next, at step S10002, whether the retrieved geometries are equal todetermined geometries is determined. The determined geometries may bepredetermined.

If the retrieved geometries are equal to the determined geometries (Y inS10002), the block is partitioned into a determined number of sub blocksof first set of geometries at step S10003. If the retrieved geometriesare not equal to the determined geometries (N in S10002), the block ispartitioned into the determined number of sub blocks of another set ofgeometries which is different from the first set of geometries at stepS10004. The determined geometries and the determined numbers of subblocks may be predetermined.

For example, when the determined number of sub blocks is set to 2, forexample, as shown in (a1) in FIG. 45A, the block can be vertically splitinto 2 sub blocks with a 1:3 or 3:1 ratio when block width (e.g., 32) isa power of two. On the other hand, as shown in (a2) in FIG. 45A, theblock can be vertically split into 2 sub blocks with a 1:2 or 1:2 ratiowhen the width (e.g., 24) is not a power of two. Similarly, a block canbe horizontally split into two sub blocks according to whether the blockheight of the block is a power of two.

As another example, as shown in (c1) in FIG. 45C, when the determinednumber of sub blocks is set to 2, the block can be horizontally splitinto 2 sub blocks with equal size if block width (e.g., 8) is smallerthan block height (e.g., 32). On the other hand, as shown in (c2) inFIG. 45C, the block can be vertically split into 2 sub blocks with equalsize if the width (e.g., 32) is larger than block height (e.g., 8).

When the determined number of sub blocks is set to 4, for example, asshown in (b1) in FIG. 45B, the block can be split into 4 sub blockswhere the width of the largest sub block is 3 times the width of thesmallest sub block when block width (e.g., 32) of the block is a powerof two. On the other hand, as shown in (b2) FIG. 45B, the block can besplit into 4 sub blocks where the width of the largest sub block is 2times the width of the smallest sub block when block width (e.g., 24) ofthe block is not a power of two.

As another example, when the determined number of sub blocks is set to4, as shown in (dl) in FIG. 45D, when block width (e.g., 32) of a blockis the same as block height (e.g., 32) of the block, the block can beequally split at both vertical and horizontal directions. When blockwidth (e.g., 32) of the block is four times block height of the block(e.g., 8), as shown in (d2) in FIG. 45D, the block can be equally splitat vertical direction. Similarly, when block height (e.g., 32) of theblock is four times block width of the block (e.g., 8), the block can beequally split at horizontal direction. As illustrated in FIG. 45Athrough FIG. 45D, in this embodiment, at least one of sub block heightand width is a power of 2. Note that the sub block height and/or widthneed not be limited to a power of 2.

At step S10005, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image decoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 6 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; determineswhether the parameter written is equal to a determined value; when theparameter written is equal to the determined value, partitions the blockinto a determined number of sub blocks of a first set of geometries;when the parameter written is not equal to the determined value,partitions the block into the determined number of sub blocks of anotherset of geometries which is different from the first set of geometries;and encodes a sub block in an encoding process including a transformprocess and/or a prediction process.

This makes it possible to switch between geometry sets for a determinednumber of partitioned sub blocks based on whether the parameter is equalto the determined value or not. The determined numbers of sub blocks andthe determined values may be predetermined.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the encoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to obtain sub blocks in sizes suitable for encoding, andimprove compression efficiency.

A decoder according to one aspect of the present disclosure decodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor: parses a parameter from abitstream; determines whether the parameter parsed is equal to adetermined value; when the parameter parsed is equal to the determinedvalue, partitions the block into a determined number of sub blocks of afirst set of geometries; when the parameter parsed is not equal to thedetermined value, partitions the block into the determined number of subblocks of another set of geometries which is different from the firstset of geometries; and decodes a sub block in a decoding processincluding an inverse transform process and/or a prediction process. Thedetermined numbers of sub blocks and the determined values may bepredetermined.

This makes it possible to switch between geometry sets for a determinednumber of partitioned sub blocks based on whether the parameter is equalto the determined value or not.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the decoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to use sub blocks in sizes suitable for decoding, and improvecompression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 21 and FIG. 22.

[Encoding Process]

FIG. 21 illustrates one example of a video encoding process according toEmbodiment 6.

As a first step S11001, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S11002, whether the written parameters are equal todetermined values is determined. The determined values may bepredetermined.

If the written parameters are equal to the determined values (Y inS11002), the block is partitioned into a determined number of sub blocksof first set of geometries at step S11003. If the written parameters arenot equal to the determined values (N in S11002), the block ispartitioned into the determined number of sub blocks of another set ofgeometries which is different from the first set of geometries at stepS11004. The determined numbers of sub blocks and the determined valuesmay be predetermined.

The written parameters can indicate partitioning mode (e.g.,quad-tree/binary/multiple tree partition, horizontal/vertical partition,symmetric/asymmetric partition, and ratio of block width/height of subblocks).

For a 24×32 block, for example, as shown in (a1) in FIG. 46A, thewritten parameters can indicate the partition is a binary partition, thepartition is a vertical partition, and ratio of block width of the twosub blocks is 1:2. As such, the 24×32 block is partitioned into a 8×32sub block and a 16×32 sub block.

As another example, for a 24×32 block, as shown in (a2) in FIG. 46A, thewritten parameters can indicate the partition is a binary partition, thepartition is a vertical partition, and ratio of block width of the twosub blocks is 2:1. As such, the 24×32 block is partitioned into a 16×32sub block and a 8×32 sub block.

For example, for a 24×24 block, as shown in (bl) in FIG. 46B, thewritten parameters can indicate the partition is a quad-tree partition,top left sub block is the largest sub block, and ratio of block width ofthe largest and smallest sub blocks is 2:1. As such, the 24×24 block ispartitioned into a 16×16 sub block, a 8×16 sub block, a 16×8 sub block,and a 8×8 sub block.

As another example, for a 24×24 block, as shown in (b2) in FIG. 46B, thewritten parameters can indicate the partition is a quad-tree partition,bottom right sub block is the largest sub block, and ratio of blockwidth of the largest and smallest sub blocks is 2:1. As such, the 24×24block is partitioned into a 8×8 sub block, a 16×8 sub block, a 8×16 subblock, and a 16×16 sub block.

For example, for a 32×32 block, as shown in (c1) FIG. 46C, the writtenparameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 1:1:2. As such, the 32×32 block is partitioned into two 8×32sub blocks and a 16×32 sub block.

As another example, for a 32×32 block, as shown in (c2) in FIG. 46C, thewritten parameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 2:1:1. As such, the 32×32 block is partitioned into a 16×32sub block and two 8×16 sub blocks.

For example, for a 32×32 block, as shown in (d1) FIG. 46D, the writtenparameters can indicate the partition is a quad-tree partition, andpartition includes both vertical and horizontal directions. As such, the32×32 block is partitioned into four 16×16 sub blocks.

As another example, for a 32×32 block, as shown in (d2) in FIG. 46D, thewritten parameters can indicate the partition is a quad-tree partition,and partition includes only vertical directions. As such, the 32×32block is partitioned into four 8×32 sub blocks.

As illustrated in FIG. 46A through FIG. 46D, in this embodiment, atleast one of sub block height and width is a power of 2. Note that thesub block height and/or width need not be limited to a power of 2.

At step S11005, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 22 illustrates one example of a video decoding process according toEmbodiment 6.

As a first step S12001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S12002, whether the parsed parameters are equal todetermined values is determined. The determined values may bepredetermined.

If the parsed parameters are equal to the determined values (YinS12002), the block is partitioned into a determined number of sub blocksof first set of geometries at step S12003. If the parsed parameters arenot equal to the determined values (N in S12002), the block ispartitioned into the determined number of sub blocks of another set ofgeometries which is different from the first set of geometries at stepS12004. The determined numbers of sub blocks and the determined valuesmay be predetermined.

The parsed parameters can indicate partitioning mode (e.g.,quad-tree/binary/multiple tree partition, horizontal/vertical partition,symmetric/asymmetric partition, and ratio of block width/height of subblocks).

For a 24×32 block, for example, as shown in (a1) in FIG. 46A, the parsedparameters can indicate the partition is a binary partition, thepartition is a vertical partition, and ratio of block width of the twosub blocks is 1:2. As such, the 24×32 block is partitioned into a 8×32sub block and a 16×32 sub block.

As another example, for a 24×32 block, as shown in (a2) in FIG. 46A, theparsed parameters can indicate the partition is a binary partition, thepartition is a vertical partition, and ratio of block width of the twosub blocks is 2:1. As such, the 24×32 block is partitioned into a 16×32sub block and a 8×32 sub block.

For example, for a 24×24 block, as shown in (bl) in FIG. 46B, the parsedparameters can indicate the partition is a quad-tree partition, top leftsub block is the largest sub block, and ratio of block width of thelargest and smallest sub blocks is 2:1. As such, the 24×24 block ispartitioned into a 16×16 sub block, a 8×16 sub block, a 16×8 sub block,and a 8×8 sub block.

As another example, for a 24×24 block, as shown in (b2) in FIG. 46B, theparsed parameters can indicate the partition is a quad-tree partition,bottom right sub block is the largest sub block, and ratio of blockwidth of the largest and smallest sub blocks is 2:1. As such, the 24×24block is partitioned into a 8×8 sub block, a 16×8 sub block, a 8×16 subblock, and a 16×16 sub block.

For example, for a 32×32 block, as shown in (c1) FIG. 46C, the parsedparameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 1:1:2. As such, the 32×32 block is partitioned into two 8×32sub blocks and a 16×32 sub block.

As another example, for a 32×32 block, as shown in (c2) in FIG. 46C, theparsed parameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 2:1:1. As such, the 32×32 block is partitioned into a 16×32sub block and two 8×16 sub blocks.

For example, for a 32×32 block, as shown in (d1) FIG. 46D, the parsedparameters can indicate the partition is a quad-tree partition, andpartition includes both vertical and horizontal directions. As such, the32×32 block is partitioned into four 16×16 sub blocks.

As another example, for a 32×32 block, as shown in (d2) in FIG. 46D, theparsed parameters can indicate the partition is a quad-tree partition,and partition includes only vertical directions. As such, the 32×32block is partitioned into four 8×32 sub blocks.

As illustrated in FIG. 46A through FIG. 46D, in this embodiment, atleast one of sub block height and width is a power of 2. Note that thesub block height and/or width need not be limited to a power of 2.

At step S12005, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 7 [Outline]

An encoder according to one aspect of the present disclosure encodes ablock of an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor: retrieves a geometry of ablock; determines whether the geometry retrieved is equal to adetermined geometry; when the geometry retrieved is equal to thedetermined geometry, partitions the block into a first number of subblocks;

when the geometry retrieved is not equal to the determined geometry,partitions the block into a number of sub blocks which is not equal tothe first number; and encodes a sub block in an encoding processincluding a transform process and/or a prediction process. Thedetermined geometry may be predetermined.

This makes it possible to partition a block into a number of sub blocksthat is based on the geometry of the block. Accordingly, it is possibleto reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency. Furthermore, it ispossible to make the number of sub blocks depend on the geometry of theblock. As a result, it is possible to more efficiently partition a blockand improve compression efficiency.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the encoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to obtain sub blocks in sizes suitable for encoding, andimprove compression efficiency. A decoder according to one aspect of thepresent disclosure decodes a block of an image, and includes a processorand memory connected to the processor. Using the memory, the processor:retrieves a geometry of a block; determines whether the geometryretrieved is equal to a determined geometry; when the geometry retrievedis equal to the determined geometry, partitions the block into a firstnumber of sub blocks; when the geometry retrieved is not equal to thedetermined geometry, partitions the block into a number of sub blockswhich is not equal to the first number; and decodes a sub block in adecoding process including an inverse transform process and/or aprediction process. The determined geometry may be predetermined.

This makes it possible to partition a block into a number of sub blocksthat is based on the geometry of the block. Accordingly, it is possibleto reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency. Furthermore, it ispossible to make the number of sub blocks depend on the geometry of theblock. As a result, it is possible to more efficiently partition a blockand improve compression efficiency.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the decoder according to this embodiment, at least oneof a height and a width of the sub block may be a power of two.

This makes it possible to partition a block so that at least one of theheight and the width of a sub block is a power of 2. Accordingly, it ispossible to use sub blocks in sizes suitable for decoding, and improvecompression efficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 23 and FIG. 24.

[Encoding Process]

FIG. 23 illustrates one example of a video encoding process according toEmbodiment 7.

As a first step S13001, geometries of a block are retrieved. Here,geometry indicates at least a shape, or a height, or a width of a block.As shown in FIG. 44, using different geometries will result inpartitioning a block into a plurality of sub blocks with differentshape, or block height, or block width.

Next, at step S13002, whether the retrieved geometries are equal todetermined geometries is determined. The determined geometries may bepredetermined.

If the retrieved geometries are equal to the determined geometries (Y inS13002), the block is partitioned into a first number of sub blocks atstep S13003. If the retrieved geometries are not equal to the determinedgeometries (N in S13002), the block is partitioned into a number, whichis not equal to said first number, of sub blocks at step S13004.

For example, as shown in (a1) in FIG. 47A, a block (e.g., 32×32) can bevertically split into 4 sub blocks of same sizes (e.g., 8×32) when theblock width of the block is a power of two. On the other hand, as shownin (a2) in FIG. 47A, a block (e.g., 24×32) can be vertically split into3 sub blocks at same sizes (e.g., 8×32) when the block width of theblock is not a power of two.

As another example, as shown in (b1) in FIG. 47B, a block (e.g., 64×32)can be equally split into 8 sub blocks of equal size (e.g., 16×16) whenboth the block width and the block height of the block are power of twowhile the block width is 2 times the block height. On the other hand, asshown in (b2) in FIG. 47B, a block (e.g., 32×32) can be equally splitinto 4 sub blocks with equal size (e.g., 16×16) when both the blockwidth and the block height of the block are power of two and the blockwidth is same as the block height.

As illustrated in FIG. 47A through FIG. 47B, in this embodiment, atleast one of sub block height and width is a power of 2. Note that thesub block height and/or width need not be limited to a power of 2.

At step S13005, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 24 illustrates one example of a video decoding process according toEmbodiment 7.

As a first step S14001, geometries of a block are retrieved. Here,geometry indicates at least a shape, or a height, or a width of a block.As shown in FIG. 44, using different geometries will result inpartitioning a block into a plurality of sub blocks with differentshape, or block height, or block width.

Next, at step S14002, whether the retrieved geometries are equal todetermined geometries is determined. The determined geometries may bepredetermined.

If the retrieved geometries are equal to the determined geometries (Y inS14002), the block is partitioned into a first number of sub blocks atstep S14003. If the retrieved geometries are not equal to the determinedgeometries (N in S14002), the block is partitioned into a number, whichis not equal to said first number, of sub blocks at step S14004.

For example, as shown in (a1) in FIG. 47A, a block (e.g., 32×32) can bevertically split into 4 sub blocks of same sizes (e.g., 8×32) when theblock width of the block is a power of two. On the other hand, as shownin (a2) in FIG. 47A, a block (e.g., 24×32) can be vertically split into3 sub blocks at same sizes (e.g., 8×32) when the block width of theblock is not a power of two.

As another example, as shown in (b1) in FIG. 47B, a block (e.g., 64×32)can be equally split into 8 sub blocks of equal size (e.g., 16×16) whenboth the block width and the block height of the block are power of twowhile the block width is 2 times the block height. On the other hand, asshown in (b2) in FIG. 47B, a block (e.g., 32×32) can be equally splitinto 4 sub blocks with equal size (e.g., 16×16) when both the blockwidth and the block height of the block are power of two and the blockwidth is same as the block height.

As illustrated in FIG. 47A through FIG. 47B, in this embodiment, atleast one of sub block height and width is a power of 2. Note that thesub block height and/or width need not be limited to a power of 2.

At step S14005, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 8 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; determineswhether the parameter written is equal to a determined value; when theparameter written is equal to the determined value, partitions the blockinto a first number of sub blocks, wherein the first number is largerthan two when a process for partitioning the block is in a singlevertical or horizontal direction, and larger than three when the processfor partitioning the block is not in a single vertical or horizontaldirection; when the parameter written is not equal to the determinedvalue, partitions the block into a second number of sub blocks which isnot equal to the first number, wherein the second number is larger thantwo when the process for partitioning the block is in a single verticalor horizontal direction, and larger than three when the process forpartitioning the block is not in a single vertical or horizontaldirection; and encodes a sub block in an encoding process including atransform process and/or a prediction process. The determined value maybe predetermined.

This makes it possible to switch between the number of partitioned subblocks based on whether the parameter is equal to the determined valueor not. A decoder according to this embodiment decodes a block of animage, and includes a processor and memory connected to the processor.Using the memory, the processor: parses a parameter from a bitstream;determines whether the parameter parsed is equal to a determined value;when the parameter parsed is equal to the determined value, partitionsthe block into a first number of sub blocks, wherein the first number islarger than two when a process for partitioning the block is in a singlevertical or horizontal direction, and larger than three when the processfor partitioning the block is not in a single vertical or horizontaldirection; when the parameter parsed is not equal to the determinedvalue, partitions the block into a second number of sub blocks which isnot equal to the first number, wherein the second number is larger thantwo when the process for partitioning the block is in a single verticalor horizontal direction, and larger than three when the process forpartitioning the block is not in a single vertical or horizontaldirection; and decodes a sub block in a decoding process including aninverse transform process and/or a prediction process.

This makes it possible to switch between the number of partitioned subblocks based on whether the parameter is equal to the determined valueor not.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 25 and FIG. 26.

[Encoding Process]

FIG. 25 illustrates one example of a video encoding process according toEmbodiment 8.

As a first step S15001, parameters are written into a bitstream. FIG. 37shows the possible locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S15002, whether the written parameters are equal todetermined values is determined. The determined values may bepredetermined. If the written parameters are equal to the determinedvalues (Y in S15002), the block is partitioned into a first number ofsub blocks at step S15003. Here, the first number is larger than twowhen the process for partitioning the block is in a single vertical orhorizontal direction, and larger than three when the process forpartitioning the block is not in a single vertical or horizontaldirection. If the written parameters are not equal to the determinedvalues (N in S15002), the block is partitioned into a second number,which is not equal to the first number, of sub blocks at step S15004.Here, the second number is larger than two when the process forpartitioning the block is in a single vertical or horizontal direction,and larger than three when the process for partitioning the block is notin a single vertical or horizontal direction.

For example, for a 32×32 block, as shown in (a1) FIG. 48A, the writtenparameters can indicate the partition is a quad-tree partition, and thepartition includes only vertical directions. As such, the 32×32 block ispartitioned into four 8×32 sub blocks.

As another example, for a 32×32 block, as shown in (a2) in FIG. 48A, thewritten parameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 1:2:1. As such, the 32×32 block is partitioned into a 8×32 subblock, a 16×32 sub block, and a 8×32 sub block.

For example, for a 32×32 block, as shown in (bl) FIG. 48B, the writtenparameters can indicate the partition is a quad-tree partition, and thepartition includes only horizontal directions. As such, the 32×32 blockis partitioned into four 32×8 sub blocks.

As another example, for a 32×32 block, as shown in (b2) in FIG. 48B, thewritten parameters can indicate the partition is a triple partition, thepartition is a horizontal partition, and ratio of block height of subblocks is 1:2:1. As such, the 32×32 block is partitioned into a 32×8 subblock, a 32×16 sub block, and a 32×8 sub block.

For example, for a 32×32 block, as shown in (c1) FIG. 48C, the writtenparameters can indicate the partition is a quad-tree partition, thepartition includes both vertical and horizontal directions. As such, the32×32 block is partitioned into four 16×16 sub blocks.

As another example, for a 32×32 block, as shown in (c2) in FIG. 48C, thewritten parameters can indicate the partition is a multiple partition,the partition includes both vertical and horizontal directions, and thenumber of sub blocks is 16. As such, the 32×32 block is partitioned intosixteen 8×8 sub blocks.

At step S15005, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 26 illustrates one example of a video decoding process according toEmbodiment 8.

As a first step S16001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the above mentioned parameters in acompressed video bitstream.

Next, at step S16002, whether the parsed parameters are equal todetermined values is determined. The determined values may bepredetermined.

If the parsed parameters are equal to the determined values (YinS16002), the block is partitioned into a first number of sub blocks atstep S16003. Here, the first number is larger than two when the processfor partitioning the block is in a single vertical or horizontaldirection, and larger than three when the process for partitioning theblock is not in a single vertical or horizontal direction. If the parsedparameters are not equal to the determined values (N in S16002), theblock is partitioned into a second number, which is not equal to thefirst number, of sub blocks at step S16004. Here, the second number islarger than two when the process for partitioning the block is in asingle vertical or horizontal direction, and larger than three when theprocess for partitioning the block is not in a single vertical orhorizontal direction.

For example, for a 32×32 block, as shown in (a1) FIG. 48A, the parsedparameters can indicate the partition is a quad-tree partition, and thepartition includes only vertical directions. As such, the 32×32 block ispartitioned into four 8×32 sub blocks.

As another example, for a 32×32 block, as shown in (a2) in FIG. 48A, theparsed parameters can indicate the partition is a triple partition, thepartition is a vertical partition, and ratio of block width of subblocks is 1:2:1. As such, the 32×32 block is partitioned into a 8×32 subblock, a 16×32 sub block, and a 8×32 sub block.

For example, for a 32×32 block, as shown in (bl) FIG. 48B, the parsedparameters can indicate the partition is a quad-tree partition, and thepartition includes only horizontal directions. As such, the 32×32 blockis partitioned into four 32×8 sub blocks.

As another example, for a 32×32 block, as shown in (b2) in FIG. 48B, theparsed parameters can indicate the partition is a triple partition, thepartition is a horizontal partition, and ratio of block height of subblocks is 1:2:1. As such, the 32×32 block is partitioned into a 32×8 subblock, a 32×16 sub block, and a 32×8 sub block.

For example, for a 32×32 block, as shown in (c1) FIG. 48C, the parsedparameters can indicate the partition is a quad-tree partition, thepartition includes both vertical and horizontal directions. As such, the32×32 block is partitioned into four 16×16 sub blocks.

As another example, for a 32×32 block, as shown in (c2) in FIG. 48C, theparsed parameters can indicate the partition is a multiple partition,the partition includes both vertical and horizontal directions, and thenumber of sub blocks is 16. As such, the 32×32 block is partitioned intosixteen 8×8 sub blocks.

At step S16005, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 9 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a partition candidate selection parameterinto a bitstream; selects a smaller set of block partitioninginformation from a larger determined set of block partitioninginformation using the partition candidate selection parameter written;writes a partition selection parameter into the bitstream; identifiesblock partitioning information from only the smaller set of blockpartitioning information selected, using the partition selectionparameter written, wherein using the block partitioning informationidentified will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries; partitions a block into aplurality of sub blocks using the block partitioning informationidentified; and encodes a sub block in an encoding process including atransform process and/or a prediction process. The determined set ofblock partitioning information may be predetermined.

This makes it possible to select block partitioning information instages from among a determined block partitioning information set, usingtwo parameters. Accordingly, so long as the smaller block partitioninginformation set is appropriately classified, it is possible to make aneffective selection. As a result, it is possible to reduce the amount ofcoding pertaining to block partitioning information and improvecompression efficiency.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: parses a partition candidate selection parameterfrom a bitstream; selects a smaller set of block partitioninginformation from a larger determined set of block partitioninginformation using the partition candidate selection parameter parsed;parses a partition selection parameter from the bitstream; identifiesblock partitioning information from only the smaller set of blockpartitioning information selected, using the partition selectionparameter parsed, wherein using the block partitioning informationidentified will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries; partitions a block into aplurality of sub blocks using the block partitioning informationidentified; and decodes a sub block in a decoding process including aninverse transform process and/or a prediction process.

This makes it possible to select block partitioning information instages from among a determined block partitioning information set, usingtwo parameters. Accordingly, so long as the smaller block partitioninginformation set is appropriately classified, it is possible to make aneffective selection. As a result, it is possible to reduce the amount ofcoding pertaining to block partitioning information and improvecompression efficiency.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 27 and FIG. 28.

[Encoding Process]

FIG. 27 illustrates one example of a video encoding process according toEmbodiment 9.

As a first step 817001, partition candidate selection parameters arewritten into a bitstream. FIG. 37 shows the possible locations of thepartition candidate selection parameters in a compressed videobitstream.

Next, at step S17002, a smaller set of block partitioning information isselected from a larger determined set of block partitioning informationusing the written partition candidate selection parameters. Thedetermined set of block partitioning information may be predetermined.

The written partition candidate selection parameters, for example, caninclude an index to select a set of block partitioning information fromtwo or more sets of block partitioning information.

Block partitioning information using different partitioning methods(e.g., vertical partition, horizontal partition, and quad-treepartition) can be categorized into different groups (sets) of blockpartitioning information. For example, as shown in FIG. 49A, there arethree groups of block partitioning information, specifically a verticalpartition group (first set), a horizontal partition group (second set),and a quad-tree partition group (third set). The vertical partitiongroup supports vertical partition only, the horizontal partition groupsupports horizontal partition only, and the quad-tree partition groupsupports quad-tree partition only. If the value of the index equals 0,the vertical partition group will be selected. If the value of the indexequals 1, the horizontal partition group will be selected. If the valueof the index equals 2, the quad-tree partition group will be selected.

Block partitioning information of previously encoded blocks at differentimage locations can also be categorized into different groups of blockpartitioning information. For example, block partitioning informationfrom top-left, top, and top-right blocks can be categorized as a topblock partition group (first set). Block partitioning information frombottom-left and left blocks can be categorized as a left block partitiongroup (second set). Block partitioning information from collocated andmotion compensated reference blocks can be categorized as a temporalblock partition group (third set). If the value of the index equals 0,the top block partition group will be selected. If the value of theindex equals 1, the left block partition group will be selected. If thevalue of the index equals 2, the temporal block partition group will beselected.

As another example, the written partition candidate selection parameterscan include parameters/indices to select one or more select blockpartitioning information from a set of block partitioning information asshown in FIG. 49B.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may also be a setof parameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined list of candidate block partition structuresmay be predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

As a first step S17003, partition selection parameters are written intoa bitstream. FIG. 37 shows the possible locations of the partitionselection parameter in a compressed video bitstream.

Next, at step S17004, block partitioning information is identified onlyfrom the selected smaller set of block partitioning information usingthe written partition selection parameters. Here, using the identifiedblock partitioning information will result in partitioning a block intoa plurality of sub blocks of a set of geometries, and using differentblock partitioning information will result in partitioning a block intoa plurality of sub blocks of a different set of geometries.

The written partition selection parameters, for example, can include anindex to select one of the block partitioning information from theselected smaller set of block partitioning information.

As an example, as shown in FIG. 49A, a vertical partition group (firstset) is selected as the smaller set of block partitioning information atS17002. In the vertical partition group, there are three different blockpartition structures according to three different block partitioninginformation. If the value of the index equals 0, the first blockpartition structure in the vertical partition group will be identified.If the value of the index equals 1, the second block partition structurein the vertical partition group will be identified. If the value of theindex equals 2, the third block partition structure in the verticalpartition group will be identified.

As another example, block partitioning information from top-left, top,and top-right blocks are categorized as a top block partition groupwhich has been selected as the smaller set of block partitioninginformation at S17002. If the value of the index equals 0, the blockpartition structure from top-left block will be identified. If the valueof the index equals 1, the block partition structure from top block willbe identified. If the value of the index equals 2, the block partitionstructure from top-right block will be identified.

As another example, the written partition selection parameters caninclude a plurality of split/merge flags to derive the blockpartitioning information from initial block partitioning information.

A block is then partitioned into a plurality of sub blocks using theidentified block partitioning information at step S17005.

At step S17006, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 28 illustrates one example of a video decoding process according toEmbodiment 9.

As a first step S18001, partition candidate selection parameters areparsed from a bitstream. FIG. 37 shows the parsable locations of thepartition candidate selection parameters in a compressed videobitstream.

Next, at step S18002, a smaller set of block partitioning information isselected from a larger determined set of block partitioning informationusing the parsed partition candidate selection parameters. Thedetermined set of block partitioning information may be predetermined.

The parsed partition candidate selection parameters, for example, caninclude an index to select a set of block partitioning information fromtwo or more sets of block partitioning information.

Block partitioning information using different partitioning methods(e.g., vertical partition, horizontal partition, and quad-treepartition) can be categorized into different groups (sets) of blockpartitioning information. For example, as shown in FIG. 49A, there arethree groups of block partitioning information, specifically a verticalpartition group (first set), a horizontal partition group (second set),and a quad-tree partition group (third set). The vertical partitiongroup supports vertical partition only, the horizontal partition groupsupports horizontal partition only, and the quad-tree partition groupsupports quad-tree partition only. If the value of the index equals 0,the vertical partition group will be selected. If the value of the indexequals 1, the horizontal partition group will be selected. If the valueof the index equals 2, the quad-tree partition group will be selected.

Block partitioning information of previously decoded blocks at differentimage locations can also be categorized into different groups of blockpartitioning information. For example, block partitioning informationfrom top-left, top, and top-right blocks can be categorized as top blockpartition group (first set). Block partitioning information frombottom-left and left blocks can be categorized as left block partitiongroup (second set). Block partitioning information from collocated andmotion compensated reference blocks can be categorized as temporal blockpartition group (third set). If the value of the index equals 0, the topblock partition group will be selected. If the value of the index equals1, the left block partition group will be selected. If the value of theindex equals 2, the temporal block partition group will be selected.

As another example, the parsed partition candidate selection parameterscan include parameters/indices to select one or more select blockpartitioning information from a set of block partitioning information asshown in FIG. 49B.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may also be a setof parameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined candidate list of block partition structuresmay be predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

Next, at step S18003, partition selection parameters are parsed from abitstream. FIG. 37 shows the parsable locations of the partitionselection parameters in a compressed video bitstream.

Next, at step S18004, block partitioning information is identified onlyfrom the selected smaller set of block partitioning information usingthe parsed partition selection parameters. Here, using the identifiedblock partitioning information will result in partitioning a block intoa plurality of sub blocks of a set of geometries, and using differentblock partitioning information will result in partitioning a block intoa plurality of sub blocks of a different set of geometries.

The parsed partition selection parameters, for example, can include anindex to select one of the block partitioning information from theselected smaller set of block partitioning information.

As an example, as shown in FIG. 49A, a vertical partition group (firstset) is selected as the smaller set of block partitioning information atS18002. In the vertical partition group, there are three different blockpartition structures according to three different block partitioninginformation. If the value of the index equals 0, the first blockpartition structure in the vertical partition group will be identified.If the value of the index equals 1, the second block partition structurein the vertical partition group will be identified. If the value of theindex equals 2, the third block partition structure in the verticalpartition group will be identified.

As another example, block partitioning information from top-left, top,and top-right blocks are categorized as a top block partition groupwhich has been selected as the smaller set of block partitioninginformation at S18002. If the value of the index equals 0, the blockpartition structure from top-left block will be identified. If the valueof the index equals 1, the block partition structure from top block willbe identified. If the value of the index equals 2, the block partitionstructure from top-right block will be identified.

As another example, the parsed partition selection parameters caninclude a plurality of split/merge flags to derive the blockpartitioning information from initial block partitioning information.

A block is then partitioned into a plurality of sub blocks using theidentified block partitioning information at step S18005.

At step S18006, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 10 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a parameter into a bitstream; retrievesblock information from one or more previously encoded blocks; selectinga smaller set of block partitioning information from a larger determinedset of block partitioning information using the block informationretrieved; identifying block partitioning information from only thesmaller set of block partitioning information selected, using theparameter written, wherein using the block partitioning informationidentified will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries; partitioning a current blockinto a plurality of sub blocks using the block partitioning informationidentified; and encoding a sub block in an encoding process including atransform process and/or a prediction process. The determined set ofblock partitioning information may be predetermined.

This makes it possible to narrow down the selectable block partitioninginformation from among determined block partitioning information, basedon block information for a previously encoded block, and makes itpossible to reduce the amount of coding pertaining to parameter(s) forselecting block partitioning information. As a result, it is possible toimprove compression efficiency.

For example, in the encoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the encoder according to this embodiment, the currentblock and the one or more previously encoded blocks may be differentblocks, and at least one of the one or more previously encoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to retrieve block information from one or morepreviously encoded mutually different blocks, and select a more suitablesmaller block partitioning information set. As a result, it is possibleto reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency.

For example, in the encoder according to this embodiment, the blockinformation retrieved may include at least one of information related toblock partition structure, information related to an intra predictionmode or an inter prediction mode, information related to an intraprediction direction, information related to a motion vector,information related to a reference picture, information related to aquantization parameter, and information related to a partitioning depth.

This makes it possible to use information that is more suitable forselecting the smaller block partitioning information set as blockinformation.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: parses a parameter from a bitstream; retrievesblock information from one or more previously decoded blocks; selects asmaller set of block partitioning information from a larger determinedset of block partitioning information using the block informationretrieved; identifies block partitioning information from only thesmaller set of block partitioning information selected, using theparameter parsed, wherein using the block partitioning informationidentified will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries; partitions a current block intoa plurality of sub blocks using the block partitioning informationidentified; and decodes a sub block in a decoding process including aninverse transform process and/or a prediction process. The determinedset of block partitioning information may be predetermined.

This makes it possible to narrow down the selectable block partitioninginformation from among determined block partitioning information, basedon block information for a previously decoded block, and makes itpossible to reduce the amount of coding pertaining to parameter(s) forselecting block partitioning information. As a result, it is possible toimprove compression efficiency.

For example, in the decoder according to this embodiment, geometry mayindicate at least a shape, a height, or a width of a block.

This makes it possible to use the shape and/or size of a block as thegeometry.

For example, in the decoder according to this embodiment, the currentblock and the one or more previously decoded blocks may be differentblocks, and at least one of the one or more previously decoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to retrieve block information from one or morepreviously decoded mutually different blocks, and select a more suitablesmaller block partitioning information set. As a result, it is possibleto reduce the amount of coding pertaining to block partitioninginformation and improve compression efficiency. For example, in thedecoder according to this embodiment, the block information retrievedmay include at least one of information related to block partitionstructure, information related to an intra prediction mode or an interprediction mode, information related to an intra prediction direction,information related to a motion vector, information related to areference picture, information related to a quantization parameter, andinformation related to a partitioning depth.

This makes it possible to use information that is more suitable forselecting the smaller block partitioning information set as blockinformation.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 29 and FIG. 30.

[Encoding Process]

FIG. 29 illustrates one example of a video encoding process according toEmbodiment 10.

As a first step S19001, parameters are written into a bitstream. FIG. 37shows the possible locations of the parameters in a compressed videobitstream.

Next at step S19002, block information (for example, location, blockpartition structure, intra prediction or inter prediction mode, intraprediction direction, motion vector, reference picture, quantizationparameters, and partitioning depth) is retrieved from one or morepreviously encoded blocks.

At step S19003, a smaller set of block partitioning information isselected from a larger determined set of block partitioning informationusing the retrieved block information. The determined set of blockpartitioning information may be predetermined.

For example, predicted block partitioning information can be firstlyderived using the retrieved block information. The block partitioninginformation from the larger determined set of block partitioninginformation, which has similar block partition structure as thepredicted block partitioning information, will then be selected andadded to the smaller set of block partitioning information. To selectthese block partitioning information, for example, the block partitionstructures with only a vertical split will be selected (FIG. 49A: firstset) if the predicted block partitioning information indicates that onlya vertical split is to be used. To select these block partitioninginformation, for example, the block partition structures with only ahorizontal split will be selected (FIG. 49A: second set) if thepredicted block partitioning information indicates that only ahorizontal split is to be used. As another example, to select theseblock partitioning information, the block partition structures withsame/similar geometries of sub blocks as the block partition structureaccording to the predicted block partitioning information will beselected, as shown in FIG. 50.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may be a set ofparameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined list of candidate block partition structuresmay be predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

Block partition structure from a previously encoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously encoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block. One example of how to select previously encoded blocks isto select encoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously encoded blocks that were encodedusing inter prediction will be selected.

Block partition structure from a previously encoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Predicted block partitioning information may differ based on intraprediction direction information from previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, when intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for current block. Similarly, if intra predictiondirection information from a left neighbouring block is determined to bea horizontal direction or close to a horizontal direction, a blockpartitioning information including a horizontal split can be predictedfor the current block.

Block partitioning information may be predicted according to intra/interprediction modes from previously encoded blocks. When prediction modesfrom the encoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. When prediction modesfrom the encoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously encoded blocks. When a difference between themotion vectors from the encoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the encoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined thresholds and the determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously encoded blocks. For example,when the values of quantization parameters from the encoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the encoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously encoded blocks. For example, whenreference pictures from the encoded blocks are temporally near to thecurrent image or when the reference pictures from the encoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the encoded blocks arenot near to the current image or when the reference pictures from theencoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously encoded blocks. For example, whenpartitioning depths from the encoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the encoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be predicted according topartitioning information from previously encoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be predicted from a previouslyencoded block (e.g., a collocated block, the last encoded block or anencoded block identified by a motion vector) from an encoded frame whichis different from current frame.

Block partitioning information of previously encoded blocks at differentimage locations can also be categorized into different groups of blockpartitioning information. For example, block partitioning informationfrom top-left, top, and top-right blocks can be categorized as a topblock partition group (first set). Block partitioning information frombottom-left and left blocks can be categorized as left block partitiongroup (second set). Block partitioning information from collocated andmotion compensated reference blocks can be categorized as temporal blockpartition group (third set). If the value of the index equals 0, the topblock partition group will be selected. If the value of the index equals1, the left block partition group will be selected. If the value of theindex equals 2, the temporal block partition group will be selected.

Next at step S19004, block partitioning information is identified onlyfrom the selected smaller set of block partitioning information usingthe written parameters. Here, using the identified block partitioninginformation will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries. The written partition selectionparameters, for example, can include an index to select one of the blockpartitioning information from the selected smaller set of blockpartitioning information.

For example, block partitioning information from top-left, top, andtop-right blocks are categorized as a top block partition group whichhas been selected as the smaller set of block partitioning informationat S19003. If the value of the index equals 0, the block partitionstructure from top-left block will be identified. If the value of theindex equals 1, the block partition structure from top block will beidentified. If the value of the index equals 2, the block partitionstructure from top-right block will be identified.

As another example, the written parameters can include a plurality ofsplit/merge flags to derive the block partitioning information from aninitial block partitioning information.

A block is then partitioned into a plurality of sub blocks using theidentified block partitioning information at step S19005.

At step S19006, a sub block is encoded in an encoding process. Here, theencoding process includes a transform process and/or a predictionprocess. The transform process may be performed on a per block basissimilar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 30 illustrates one example of a video decoding process according toEmbodiment 10.

As a first step S20001, parameters are parsed from a bitstream. FIG. 37shows the parsable locations of the parameters in a compressed videobitstream.

Next at step S20002, block information (for example, location, blockpartition structure, intra prediction or inter prediction mode, intraprediction direction, motion vector, reference picture, quantizationparameters, and partitioning depth) is retrieved from one or morepreviously decoded blocks.

At step S20003, a smaller set of block partitioning information isselected from a larger determined set of block partitioning informationusing the retrieved block information. The determined set of blockpartitioning information may be predetermined.

For example, predicted block partitioning information can be firstlyderived using the retrieved block information. The block partitioninginformation from the larger determined set of block partitioninginformation, which has similar block partition structure as thepredicted block partitioning information, will then be selected andadded to the smaller set of block partitioning information. To selectthese block partitioning information, for example, the block partitionstructures with only a vertical split will be selected (FIG. 49A: firstset) if the predicted block partitioning information indicates that onlya vertical split is to be used. To select these block partitioninginformation, for example, the block partition structures with only ahorizontal split will be selected (FIG. 49A: second set) if thepredicted block partitioning information indicates that only ahorizontal split is to be used. As another example, to select theseblock partitioning information, the block partition structures withsame/similar geometries of sub blocks as the block partition structureaccording to the predicted block partitioning information will beselected, as shown in FIG. 50.

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may be a set ofparameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined candidate list of block partition structuresmay be predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

Block partition structure from a previously decoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously decoded blockscan also be combined (for example, the top half uses the block partitionstructure from the top block and the left half uses the block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block. One example of how to select previously decoded blocks isto select decoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously decoded blocks that were decodedusing inter prediction will be selected.

Block partition structure from a previously decoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Predicted block partitioning information may differ based on intraprediction direction information from previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, when intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for current block. Similarly, if intra predictiondirection information from a left neighbouring block is determined to bea horizontal direction or close to a horizontal direction, a blockpartitioning information including a horizontal split can be predictedfor the current block.

Block partitioning information may be predicted according to intra/interprediction modes from previously decoded blocks. When prediction modesfrom the decoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. When prediction modesfrom the decoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously decoded blocks. When a difference between themotion vectors from the decoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the decoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined thresholds and the determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously decoded blocks. For example,when the values of quantization parameters from the decoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the decoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously decoded blocks. For example, whenreference pictures from the decoded blocks are temporally near to thecurrent image or when the reference pictures from the decoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the decoded blocks arenot near to the current image or when the reference pictures from thedecoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously decoded blocks. For example, whenpartitioning depths from the decoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the decoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be predicted according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, block partitioninginformation (which includes split information) for the current block, orthe current block's split information can be predicted from a previouslydecoded block (e.g., a collocated block, the last decoded block or adecoded block identified by a motion vector) from a decoded frame whichis different from current frame.

Block partitioning information of previously decoded blocks at differentimage locations can also be categorized into different groups of blockpartitioning information. For example, block partitioning informationfrom top-left, top, and top-right blocks can be categorized as a topblock partition group (first set). Block partitioning information frombottom-left and left blocks can be categorized as left block partitiongroup (second set). Block partitioning information from collocated andmotion compensated reference blocks can be categorized as temporal blockpartition group (third set). If the value of the index equals 0, the topblock partition group will be selected. If the value of the index equals1, the left block partition group will be selected. If the value of theindex equals 2, the temporal block partition group will be selected.

Next at step S20004, block partitioning information is identified onlyfrom the selected smaller set of block partitioning information usingthe parsed parameters. Here, using the identified block partitioninginformation will result in partitioning a block into a plurality of subblocks of a set of geometries, and using different block partitioninginformation will result in partitioning a block into a plurality of subblocks of a different set of geometries.

The parsed partition selection parameters, for example, can include anindex to select one of the block partitioning information from theselected smaller set of block partitioning information.

For example, block partitioning information from top-left, top, andtop-right blocks are categorized as a top block partition group whichhas been selected as the smaller set of block partitioning informationat S20003. If the value of the index equals 0, the block partitionstructure from top-left block will be identified. If the value of theindex equals 1, the block partition structure from top block will beidentified. If the value of the index equals 2, the block partitionstructure from top-right block will be identified.

As another example, the parsed partition selection parameters caninclude a plurality of split/merge flags to derive the blockpartitioning information from initial block partitioning information.

A block is then partitioned into a plurality of sub blocks using theidentified block partitioning information at step S20005.

At step S20006, a sub block is decoded in a decoding process. Here, thedecoding process includes an inverse transform process and/or aprediction process. The inverse transform process may be performed on aper block basis similar to the sub block size.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 11 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: writes a list modification parameter into abitstream; modifies a determined list of block partitioning informationinto a modified list of block partitioning information using the listmodification parameter written; writes a partition selection parameterinto the bitstream; selects block partitioning information from only themodified list of block partitioning information using the partitionselection parameter written, wherein using the block partitioninginformation selected will result in partitioning a block into aplurality of sub blocks; partitions a block into a plurality of subblocks using the block partitioning information selected; and encodes asub block included in the plurality of sub blocks in an encoding processincluding a transform process and/or a prediction process. Thedetermined list of block partitioning information may be predetermined.

This makes it possible to modify a determined list of block partitioninginformation using a list modification parameter from a bitstream.Accordingly, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

For example, in the encoder according to this embodiment, modifying thedetermined list of block partitioning information may include reorderingthe determined list of block partitioning information to generate themodified list of block partitioning information, and the partitionselection parameter may be encoded using fewer bits to indicate blockpartitioning information earlier in list order than block partitioninginformation later in list order.

This makes it possible to reorder a determined list of blockpartitioning information using a list modification parameter from abitstream. Accordingly, it is easier to place block partitioninginformation that is more likely to be selected at the top of the list,which makes it possible to reduce the amount of coding pertaining toblock partitioning information.

For example, in the encoder according to this embodiment, modifying thedetermined list of block partitioning information may include insertingadditional partitioning information into the determined list of blockpartitioning information to generate a longer list of block partitioninginformation.

This makes it possible to insert additional block partitioninginformation into a determined list of block partitioning informationusing a list modification parameter from a bitstream. Accordingly, it iseasier to add block partitioning information suitable for blockpartitioning to the list, and possible to improve compressionefficiency.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: parses a list modification parameter from abitstream; modifies a determined list of block partitioning informationinto a modified list of block partitioning information using the listmodification parameter parsed; parses a partition selection parameterfrom the bitstream; selects block partitioning information from only themodified list of block partitioning information using the partitionselection parameter parsed, wherein using the block partitioninginformation selected will result in partitioning a block into aplurality of sub blocks; partitions a block into a plurality of subblocks using the block partitioning information selected; and decodes asub block included in the plurality of sub blocks in a decoding processincluding an inverse transform process and/or a prediction process.

This makes it possible to modify a determined list of block partitioninginformation using a list modification parameter from a bitstream.Accordingly, it is possible to reduce the amount of coding pertaining toblock partitioning information and improve compression efficiency.

For example, in the decoder according to this embodiment, modifying thedetermined list of block partitioning information may include reorderingthe determined list of block partitioning information to generate themodified list of block partitioning information, and the partitionselection parameter may be encoded using fewer bits to indicate blockpartitioning information earlier in list order than block partitioninginformation later in list order.

This makes it possible to reorder a determined list of blockpartitioning information using a list modification parameter from abitstream. Accordingly, it is easier to place block partitioninginformation that is more likely to be selected at the top of the list,which makes it possible to reduce the amount of coding pertaining toblock partitioning information.

For example, in the decoder according to this embodiment, modifying thedetermined list of block partitioning information may include insertingadditional partitioning information into the determined list of blockpartitioning information to generate a longer list of block partitioninginformation.

This makes it possible to insert additional block partitioninginformation into a determined list of block partitioning informationusing a list modification parameter from a bitstream. Accordingly, it iseasier to add block partitioning information suitable for blockpartitioning to the list, and possible to improve compressionefficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 31 and FIG. 32.

[Encoding Process]

FIG. 31 illustrates one example of a video encoding process according toEmbodiment 11.

As a first step S21001, list modification parameters are written into abitstream. FIG. 37 shows the possible locations of the parameters in acompressed video bitstream.

Next, at step S21002, a determined list of block partitioninginformation is modified into a modified list of block partitioninginformation using the written list modification parameters. Thedetermined list of block partitioning information may be predetermined.For example, the modification can be a process to reorder the determinedlist of block partitioning information to generate a modified list ofblock partitioning information. Here, partition selection parameters arecoded using lesser bits to indicate block partitioning informationearlier in the order of the list than block partitioning informationlater in the order of the list. With reordering, the selected blockpartitioning information will be placed earlier in the list and thecoding bits of partition selection parameters will be reduced, as shownin FIG. 51.

To reorder the list, for example, the list can be classified intodifferent groups of block partitioning information (e.g., verticalpartition group, horizontal partition group, quad-tree partition group,and all partition group which includes all block partitioninginformation). By reordering these groups of block partitioninginformation, the reordering of the list is achieved as shown in FIG. 52.In this example, the list modification parameters can include parametersto indicate the order of each group of block partitioning in themodified list of block partitioning information.

Limitation of the block partitioning information in each group can bedone implicitly by utilizing the geometries of a current block. Forexample, it is possible to limit usage to only partition that results inblock width and block height being a power of two. For such blockpartitioning information, information resulting in either sub blockwidth or sub block height that is not a power of two will not be used inthe group.

As another example, the modification may be a process to insertadditional block partitioning information into a determined list ofblock partitioning information to generate a longer list of blockpartitioning information. The coded bits of partition selectionparameters will be reduced when the most likely block partitioninginformation is inserted at the front of the list. Here, partitionselection parameters are coded using lesser bits to indicate blockpartitioning information earlier in the order of the list than blockpartitioning information later in the order of the list.

As another example, the modification can also be a process to removeblock partitioning information from a determined list of blockpartitioning information to generate a shorter list of blockpartitioning information. The coded bits of partition selectionparameters will be reduced when the unlikely block partitioninginformation before the most likely block partitioning information isremoved. Here, partition selection parameters are coded using lesserbits to indicate block partitioning information earlier in the order ofthe list than block partitioning information later in the order of thelist.

Reordering, insertion, and removal processes may be combined (e.g.,reordering and insertion, or reordering and removal, or insertion andremoval, or reordering, insertion, and removal).

Limitation of the block partitioning information in a list of blockpartitioning information can be done implicitly by utilizing thegeometries of a current block. For example, it is possible to limitusage to only partition that results in block width and block heightbeing a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the list.

The list modification parameters, for example, can also indicate if nomodification is needed. If no modification is needed, steps S21002 canbe skipped. Accordingly, the modified list of block partitioninginformation is the same as the determined list of block partitioninginformation before going to step S21003.

At step S21003, partition selection parameters are written into abitstream. FIG. 37 shows the possible locations of the parameters in acompressed video bitstream.

Next, at step S21004, block partitioning information is selected onlyfrom the modified list of block partitioning information using thewritten partition selection parameters. Here, using the selected blockpartitioning information will result in partitioning a block into aplurality of sub blocks. The written partition selection parameters, forexample, can include an index to select one of the block partitioninginformation from the determined list of block partitioning information.As another example, the written partition selection parameters caninclude a plurality of split/merge flags to derive the blockpartitioning information from initial block partitioning information.

Coding bits and the meaning of the partition selection parameters variesdepending on the selected block partitioning information. For example,when only horizontal partition happens according to the selected blockpartitioning information, there is no need to indicate whether thepartition is a horizontal or vertical partition, and portioning a blocksimply means horizontally partitioning a block as shown in FIG. 53. Onthe other hand, when only vertical partition happens according to theselected block partitioning information, there is also no need toindicate whether the partition is a horizontal or vertical partition,and portioning a block simply means vertically partitioning a block.

At step S21005, a block is partitioned into a plurality of sub blocksusing the selected block partitioning information. The selected blockpartitioning information, for example, can be final block partitioninginformation used for partitioning the block into sub blocks. As anotherexample, the selected block partitioning information can also bepredicted block partitioning information or initial block partitioninginformation. Final block partitioning information will be derived forpartitioning the block into sub blocks based on the predicted blockpartitioning information or initial block partitioning information.

At step S21006, a sub block from the plurality of sub blocks is encodedin an encoding process. Here, the encoding process includes a transformprocess and/or a prediction process. The transform process may beperformed on a per block basis similar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 32 illustrates one example of a video decoding process according toEmbodiment 11.

As a first step S22001, list modification parameters are parsed from abitstream. FIG. 37 shows the parsable locations of the parameters in acompressed video bitstream.

Next, at step S22002, a determined list of block partitioninginformation is modified into a modified list of block partitioninginformation using the parsed list modification parameters. Thedetermined list of block partitioning information may be predetermined.For example, the modification can be a process to reorder the determinedlist of block partitioning information to generate a modified list ofblock partitioning information. Here, partition selection parameters aredecoded using lesser bits to indicate block partitioning informationearlier in the order of the list than block partitioning informationlater in the order of the list. With reordering, the selected blockpartitioning information will be placed earlier in the list and thecoding bits of partition selection parameters will be reduced, as shownin FIG. 51.

To reorder the list, for example, the list can be classified intodifferent groups of block partitioning information (e.g., verticalpartition group, horizontal partition group, quad-tree partition group,and all partition group which includes all block partitioninginformation). By reordering these groups of block partitioninginformation, the reordering of the list is achieved as shown in FIG. 52.In this example, the list modification parameters can include parametersto indicate the order of each group of block partitioning in themodified list of block partitioning information. Limitation of the blockpartitioning information in each group can be done implicitly byutilizing the geometries of a current block. For example, it is possibleto limit usage to only partition that results in block width and blockheight being a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the group.

As another example, the modification may be a process to insertadditional block partitioning information into a determined list ofblock partitioning information to generate a longer list of blockpartitioning information. The decoded bits of partition selectionparameters will be reduced when the most likely block partitioninginformation is inserted at the front of the list. Here, partitionselection parameters are decoded using lesser bits to indicate blockpartitioning information earlier in the order of the list than blockpartitioning information later in the order of the list.

As another example, the modification can also be a process to removeblock partitioning information from a determined list of blockpartitioning information to generate a shorter list of blockpartitioning information. The decoded bits of partition selectionparameters will be reduced when the unlikely block partitioninginformation before the most likely block partitioning information isremoved. Here, partition selection parameters are decoded using lesserbits to indicate block partitioning information earlier in the order ofthe list than block partitioning information later in the order of thelist.

Reordering, insertion, and removal processes may be combined (e.g.,reordering and insertion, or reordering and removal, or insertion andremoval, or reordering, insertion, and removal).

Limitation of the block partitioning information in a list of blockpartitioning information can be done implicitly by utilizing thegeometries of a current block. For example, it is possible to limitusage to only partition that results in block width and block heightbeing a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the list.

The list modification parameters, for example, can also indicate if nomodification is needed. If no modification is needed, steps S22002 canbe skipped. Accordingly, the modified list of block partitioninginformation is the same as the determined list of block partitioninginformation before going to step S22003.

At step S22003, partition selection parameters are parsed from abitstream. FIG. 37 shows the parsable locations of the parameters in acompressed video bitstream.

Next, at step S22004, block partitioning information is selected onlyfrom the modified list of block partitioning information using theparsed partition selection parameters. Here, using the selected blockpartitioning information will result in partitioning a block into aplurality of sub blocks. The parsed partition selection parameters, forexample, can include an index to select one of the block partitioninginformation from the determined list of block partitioning information.As another example, the parsed partition selection parameters caninclude a plurality of split/merge flags to derive the blockpartitioning information from initial block partitioning information.Decoding bits and the meaning of the partition selection parametersvaries depending on the selected block partitioning information. Forexample, when only horizontal partition happens according to theselected block partitioning information, there is no need to indicatewhether the partition is a horizontal or vertical partition, andportioning a block simply means horizontally partitioning a block asshown in FIG. 53. On the other hand, when only vertical partitionhappens according to the selected block partitioning information, thereis also no need to indicate whether the partition is a horizontal orvertical partition, and portioning a block simply means verticallypartitioning a block.

At step S22005, a block is partitioned into a plurality of sub blocksusing the selected block partitioning information. The selected blockpartitioning information, for example, can be final block partitioninginformation used for partitioning the block into sub blocks. As anotherexample, the selected block partitioning information can also bepredicted block partitioning information or initial block partitioninginformation. Final block partitioning information will be derived forpartitioning the block into sub blocks based on the predicted blockpartitioning information or initial block partitioning information.

At step S22006, a sub block from the plurality of sub blocks is decodedin a decoding process. Here, the decoding process includes an inversetransform process and/or a prediction process. The inverse transformprocess may be performed on a per block basis similar to the sub blocksize.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 12 [Outline]

An encoder according to this embodiment encodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: retrieves block information from one or morepreviously encoded blocks; modifies a determined list of blockpartitioning information into a modified list of block partitioninginformation using the block information retrieved; writes a partitionselection parameter into a bitstream; selects block partitioninginformation from only the modified list of block partitioninginformation using the partition selection parameter written, whereinusing the block partitioning information selected will result inpartitioning a block into a plurality of sub blocks; partitions acurrent block into a plurality of sub blocks using the blockpartitioning information selected; and encodes a sub block included inthe plurality of sub blocks in an encoding process including a transformprocess and/or a prediction process. The determined list of blockpartitioning information may be predetermined.

This makes it possible to modify a determined list of block partitioninginformation using block information retrieved from a previously encodedblock. Accordingly, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency.

For example, in the encoder according to this embodiment, modifying thedetermined list of block partitioning information may include reorderingthe determined list of block partitioning information to generate themodified list of block partitioning information, and the partitionselection parameter may be encoded using fewer bits to indicate blockpartitioning information earlier in list order than block partitioninginformation later in list order.

This makes it possible to reorder a determined list of blockpartitioning information using block information retrieved from apreviously encoded block. Accordingly, it is easier to place blockpartitioning information that is more likely to be selected at the topof the list, which makes it possible to reduce the amount of codingpertaining to block partitioning information.

For example, in the encoder according to this embodiment, modifying thedetermined list of block partitioning information may include insertingadditional partitioning information into the determined list of blockpartitioning information to generate a longer list of block partitioninginformation.

This makes it possible to insert additional block partitioninginformation into a determined list of block partitioning informationusing block information retrieved from a previously encoded block.Accordingly, it is easier to add block partitioning information suitablefor block partitioning to the list, and possible to improve compressionefficiency.

For example, in the encoder according to this embodiment, the currentblock and the one or more previously encoded blocks may be differentblocks, and at least one of the one or more previously encoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to retrieve block information from one or morepreviously encoded mutually different blocks, and more suitably modifythe block partitioning information list. As a result, it is possible toimprove compression efficiency.

For example, in the encoder according to this embodiment, the blockinformation retrieved may include at least one of information related toblock partition structure, information related to an intra predictionmode or an inter prediction mode, information related to an intraprediction direction, information related to a motion vector,information related to a reference picture, information related to aquantization parameter, and information related to a partitioning depth.

This makes it possible to use information appropriate as blockinformation, which makes it possible to modify the block partitioninginformation list using block information further suitable for blockpartitioning. As a result, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency.

A decoder according to this embodiment decodes a block of an image, andincludes a processor and memory connected to the processor. Using thememory, the processor: retrieves block information from one or morepreviously decoded blocks; modifies a determined list of blockpartitioning information into a modified list of block partitioninginformation using the block information retrieved; parses a partitionselection parameter from a bitstream; selects block partitioninginformation from only the modified list of block partitioninginformation using the partition selection parameter parsed, whereinusing the block partitioning information selected will result inpartitioning a block into a plurality of sub blocks; partitions acurrent block into a plurality of sub blocks using the blockpartitioning information selected; and decodes a sub block included inthe plurality of sub blocks in a decoding process including an inversetransform process and/or a prediction process.

This makes it possible to modify a determined list of block partitioninginformation using block information retrieved from a previously decodedblock. Accordingly, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency.

For example, in the decoder according to this embodiment, modifying thedetermined list of block partitioning information may include reorderingthe determined list of block partitioning information to generate themodified list of block partitioning information, and the partitionselection parameter may be encoded using fewer bits to indicate blockpartitioning information earlier in list order than block partitioninginformation later in list order.

This makes it possible to reorder a determined list of blockpartitioning information using block information retrieved from apreviously decoded block. Accordingly, it is easier to place blockpartitioning information that is more likely to be selected at the topof the list, which makes it possible to reduce the amount of codingpertaining to block partitioning information.

For example, in the decoder according to this embodiment, modifying thedetermined list of block partitioning information may include insertingadditional partitioning information into the determined list of blockpartitioning information to generate a longer list of block partitioninginformation.

This makes it possible to insert additional block partitioninginformation into a determined list of block partitioning informationusing block information retrieved from a previously decoded block.Accordingly, it is easier to add block partitioning information suitablefor block partitioning to the list, and possible to improve compressionefficiency.

For example, in the decoder according to this embodiment, the currentblock and the one or more previously decoded blocks may be differentblocks, and at least one of the one or more previously decoded blocksmay be included in a same frame as the current block or another framewhich is different from the frame including the current block.

This makes it possible to retrieve block information from one or morepreviously decoded mutually different blocks, and more suitably modifythe block partitioning information list. As a result, it is possible toimprove compression efficiency.

For example, in the decoder according to this embodiment, the blockinformation retrieved may include at least one of information related toblock partition structure, information related to an intra predictionmode or an inter prediction mode, information related to an intraprediction direction, information related to a motion vector,information related to a reference picture, information related to aquantization parameter, and information related to a partitioning depth.

This makes it possible to use information appropriate as blockinformation, which makes it possible to modify the block partitioninginformation list using block information further suitable for blockpartitioning. As a result, it is possible to reduce the amount of codingpertaining to block partitioning information and improve compressionefficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Hereinafter, methods for encoding and decoding video will be describedaccording to an embodiment as illustrated in FIG. 33 and FIG. 34.

[Encoding Process]

FIG. 33 illustrates one example of a video encoding process according toEmbodiment 12.

As a first step S23001, block information (for example, block partitionstructure, intra prediction or inter prediction mode, intra predictiondirection, motion vector, reference picture, quantization parameters,and partitioning depth) is retrieved from one or more previously encodedblocks.

Next, at step S23002, a determined list of block partitioninginformation is modified into a modified list of block partitioninginformation using the retrieved block information. The determined listof block partitioning information may be predetermined. For example, themodification can be a process to reorder the determined list of blockpartitioning information to generate a modified list of blockpartitioning information. Here, partition selection parameters are codedusing lesser bits to indicate block partitioning information earlier inthe order of the list than block partitioning information later in theorder of the list. With reordering, the selected block partitioninginformation will be placed earlier in the list and the coding bits ofpartition selection parameters will be reduced, as shown in FIG. 51.

To reorder the list, for example, the list can be classified intodifferent groups of block partitioning information (e.g., verticalpartition group, horizontal partition group, quad-tree partition group,and all partition group which includes all block partitioninginformation). By reordering these groups of block partitioninginformation, the reordering of the list is achieved as shown in FIG. 52.In this example, the list modification parameters can include parametersto indicate the order of each group of block partitioning in themodified list of block partitioning information.

Limitation of the block partitioning information in each group can bedone implicitly by utilizing the geometries of a current block. Forexample, it is possible to limit usage to only partition that results inblock width and block height being a power of two. For such blockpartitioning information, information resulting in either sub blockwidth or sub block height that is not a power of two will not be used inthe group.

As another example, the modification may be a process to insertadditional block partitioning information into a determined list ofblock partitioning information to generate a longer list of blockpartitioning information. The coded bits of partition selectionparameters will be reduced when the most likely block partitioninginformation is inserted at the front of the list. Here, partitionselection parameters are coded using lesser bits to indicate blockpartitioning information earlier in the order of the list than blockpartitioning information later in the order of the list. As anotherexample, the modification can also be a process to remove blockpartitioning information from a determined list of block partitioninginformation to generate a shorter list of block partitioninginformation. The coded bits of partition selection parameters will bereduced when the unlikely block partitioning information before the mostlikely block partitioning information is removed. Here, partitionselection parameters are coded using lesser bits to indicate blockpartitioning information earlier in the order of the list than blockpartitioning information later in the order of the list.

Reordering, insertion, and removal processes may be combined (e.g.,reordering and insertion, or reordering and removal, or insertion andremoval, or reordering, insertion, and removal).

Limitation of the block partitioning information in a list of blockpartitioning information can be done implicitly by utilizing thegeometries of a current block. For example, it is possible to limitusage to only partition that results in block width and block heightbeing a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the list.

To use the retrieved block information for modifying the determined listof block partitioning information, first, predicted block partitioninginformation can be derived. For example, the block partitioninginformation from the determined list of block partitioning information,which has same/similar block partition structure as the predicted blockpartitioning information, will be moved forward in the list. Forexample, if the predicted block partition structures only includehorizontal split, group 1 as shown in FIG. 52 (before reordering) willbe moved to the front of the list as shown in FIG. 52 (afterreordering).

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may be a set ofparameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined candidate list of partitioning structures maybe predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

Block partition structure from a previously encoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously encoded blockscan also be combined (for example, the top half uses block partitionstructure from the top block and the left half uses block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block. One example of how to select previously encoded blocks isto select encoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously encoded blocks that were encodedusing inter prediction will be selected.

Block partition structure from a previously encoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Predicted block partitioning information may differ based on intraprediction direction information from previously encoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, when intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for current block. Similarly, if intra predictiondirection information from a left neighbouring block is determined to bea horizontal direction or close to a horizontal direction, a blockpartitioning information including a horizontal split can be predictedfor the current block.

Block partitioning information may be predicted according to intra/interprediction modes from previously encoded blocks. When prediction modesfrom the encoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. When prediction modesfrom the encoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously encoded blocks. When a difference between themotion vectors from the encoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the encoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined thresholds and the determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously encoded blocks. For example,when the values of quantization parameters from the encoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the encoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously encoded blocks. For example, whenreference pictures from the encoded blocks are temporally near to thecurrent image or when the reference pictures from the encoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the encoded blocks arenot near to the current image or when the reference pictures from theencoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously encoded blocks. For example, whenpartitioning depths from the encoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the encoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be predicted according topartitioning information from previously encoded blocks of a framedifferent than current frame. For example, the context/s to be used toarithmetic encode block partitioning information (which includes splitinformation) for the current block, or the current block's splitinformation, can be predicted from a previously encoded block (e.g., acollocated block, the last encoded block or an encoded block identifiedby a motion vector) from an encoded frame which is different fromcurrent frame.

At step S23003, partition selection parameters are written into abitstream. FIG. 37 shows the possible locations of the partitionselection parameter in a compressed video bitstream.

Next, at step S23004, block partitioning information is selected onlyfrom the modified list of block partitioning information using thewritten partition selection parameters. Here, using the selected blockpartitioning information will result in partitioning a block into aplurality of sub blocks. The written partition selection parameters, forexample, can include an index to select one of the block partitioninginformation from the determined list of block partitioning information.The determined list of block partitioning information may bepredetermined. As another example, the written partition selectionparameters can include a plurality of split/merge flags to derive theblock partitioning information from initial block partitioninginformation.

Coding bits and the meaning of the partition selection parameters variesdepending on the selected block partitioning information. For example,when only horizontal partition happens according to the selected blockpartitioning information, there is no need to indicate whether thepartition is a horizontal or vertical partition, and portioning a blocksimply means horizontally partitioning a block as shown in FIG. 53. Onthe other hand, when only vertical partition happens according to theselected block partitioning information, there is also no need toindicate whether the partition is a horizontal or vertical partition,and portioning a block simply means vertically partitioning a block.

At step S23005, a block is partitioned into a plurality of sub blocksusing the selected block partitioning information.

At step S23006, a sub block from the plurality of sub blocks is encodedin an encoding process. Here, the encoding process includes a transformprocess and/or a prediction process. The transform process may beperformed on a per block basis similar to the sub block size.

[Encoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 35 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

[Decoding Process]

FIG. 34 illustrates one example of a video decoding process according toEmbodiment 12.

As a first step S24001, block information (for example, block partitionstructure, intra prediction or inter prediction mode, intra predictiondirection, motion vector, reference picture, quantization parameters,and partitioning depth) is retrieved from one or more previously decodedblocks.

Next, at step S24002, a determined list of block partitioninginformation is modified into a modified list of block partitioninginformation using the retrieved block information. The determined listof block partitioning information may be predetermined. For example, themodification can be a process to reorder the determined list of blockpartitioning information to generate a modified list of blockpartitioning information. Here, partition selection parameters aredecoded using lesser bits to indicate block partitioning informationearlier in the order of the list than block partitioning informationlater in the order of the list. With reordering, the selected blockpartitioning information will be placed earlier in the list and thecoding bits of partition selection parameters will be reduced, as shownin FIG. 51.

To reorder the list, for example, the list can be classified intodifferent groups of block partitioning information (e.g., verticalpartition group, horizontal partition group, quad-tree partition group,and all partition group which includes all block partitioninginformation). By reordering these groups of block partitioninginformation, the reordering of the list is achieved as shown in FIG. 52.In this example, the list modification parameters can include parametersto indicate the order of each group of block partitioning in themodified list of block partitioning information. Limitation of the blockpartitioning information in each group can be done implicitly byutilizing the geometries of a current block. For example, it is possibleto limit usage to only partition that results in block width and blockheight being a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the group. As another example,the modification can be a process to insert additional partitioninginformation into said determined list of block partitioning informationto generate a longer list of block partitioning information. The decodedbits of partition selection parameters will be reduced when the mostlikely block partitioning information is inserted at the front of thelist. Here, partition selection parameters are decoded using lesser bitsto indicate block partitioning information earlier in the order of thelist than block partitioning information later in the order of the list.

As another example, the modification can also be a process to removepartitioning information from the determined list of block partitioninginformation to generate a shorter list of block partitioninginformation. The decoded bits of partition selection parameters will bereduced when the unlikely block partitioning information before the mostlikely block partitioning information is removed. Here, partitionselection parameters are decoded using lesser bits to indicate blockpartitioning information earlier in the order of the list than blockpartitioning information later in the order of the list.

Reordering, insertion, and removal processes may be combined (e.g.,reordering and insertion, or reordering and removal, or insertion andremoval, or reordering, insertion, and removal).

Limitation of the block partitioning information in a list of blockpartitioning information can be done implicitly by utilizing thegeometries of a current block. For example, it is possible to limitusage to only partition that results in block width and block heightbeing a power of two. For such block partitioning information,information resulting in either sub block width or sub block height thatis not a power of two will not be used in the list.

To use the retrieved block information for modifying the determined listof block partitioning information, first, predicted block partitioninginformation can be derived. For example, the block partitioninginformation from the determined list of block partitioning information,which has same/similar block partition structure as the predicted blockpartitioning information, will be moved forward in the list. Forexample, if the predicted block partition structures only includehorizontal split, group 1 as shown in FIG. 52 (before reordering) willbe moved to the front of the list as shown in FIG. 52 (afterreordering).

Block partitioning information may be a set of parameters that indicatewhether a block is horizontally split or vertically split. Blockpartitioning information may also be a set of parameters that include adetermined block width and a determined block height for all sub blocksin a block. The determined block width and the determined block heightmay be predetermined. Block partitioning information may be a set ofparameters that include an index to select one candidate partitionstructure from a determined candidate list of block partitionstructures. The determined candidate list of block partition structuresmay be predetermined. Here, block partition structure visually presentsgeometries of all sub blocks in a block, as shown in FIG. 38.

Block partition structure from a previously decoded block can bedirectly used as the predicted block partition structure for the currentblock.

Block partition structures from two or more previously decoded blockscan also be combined (for example, the top half uses the block partitionstructure from the top block and the left half uses the block partitionstructure from the left block as shown in FIG. 39) to derive a new blockpartition structure as the predicted block partition structure for thecurrent block. One example of how to select previously decoded blocks isto select decoded blocks having same intra/inter prediction mode ascurrent block. Specifically, if the current block is an inter predictedblock, one or more of the previously decoded blocks that were decodedusing inter prediction will be selected.

Block partition structure from a previously decoded block can also bemodified (for example, use block partition structure with less partitiondepth as shown in FIG. 40) to derive a new block partition structure asthe predicted block partition structure for the current block.

Predicted block partitioning information may differ based on intraprediction direction information from previously decoded blocks. Forexample, intra prediction direction information from specificneighbouring block locations may be used to predict whether the currentblock is to be split vertically or horizontally into smaller blocks. Forexample, when intra prediction direction information from a topneighbouring block is determined to be a vertical direction or close tovertical direction, block partitioning information including a verticalsplit can be predicted for current block. Similarly, if intra predictiondirection information from a left neighbouring block is determined to bea horizontal direction or close to a horizontal direction, a blockpartitioning information including a horizontal split can be predictedfor the current block.

Block partitioning information may be predicted according to intra/interprediction modes from previously decoded blocks. When prediction modesfrom the decoded blocks are intra prediction mode, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. When prediction modesfrom the decoded blocks are inter prediction mode, other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedblock partitioning information may be predetermined.

Block partitioning information can also be predicted according to motionvectors from previously decoded blocks. When a difference between themotion vectors from the decoded blocks and the motion vectors fromcurrent block is bigger than a determined threshold, determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. On the other hand,when a difference between the motion vectors from the decoded blocks andthe motion vectors from current block is not greater than a determinedthreshold, other determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. The determined thresholds and the determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according toquantization parameters from previously decoded blocks. For example,when the values of quantization parameters from the decoded blocks aresmaller than a determined value, determined block partitioninginformation can be predicted to partition a block into a plurality ofsub blocks with smaller block sizes. When the values of quantizationparameters from the decoded blocks are not smaller than a determinedvalue, other determined block partitioning information can be predictedto partition a block into a plurality of sub blocks with larger blocksizes. The determined values and the determined block partitioninginformation may be predetermined.

Block partitioning information may be predicted according to referencepicture information from previously decoded blocks. For example, whenreference pictures from the decoded blocks are temporally near to thecurrent image or when the reference pictures from the decoded blocks aresimilar to one another, determined block partitioning information can bepredicted to partition a block into a plurality of sub blocks withlarger block sizes. When reference pictures from the decoded blocks arenot near to the current image or when the reference pictures from thedecoded blocks are not similar to one another, other determined blockpartitioning information can be predicted to partition a block into aplurality of sub blocks with smaller block sizes. The determined blockpartitioning information may be predetermined.

Block partitioning information may be predicted according topartitioning depths from previously decoded blocks. For example, whenpartitioning depths from the decoded blocks are larger than a determinedvalue (for example, determined depth value equals to 4), determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with smaller block sizes. Whenpartitioning depths from the decoded blocks are not larger thandetermined value (for example, depth equals to 2), other determinedblock partitioning information can be predicted to partition a blockinto a plurality of sub blocks with larger block sizes. The determinedvalues and the determined block partitioning information may bepredetermined.

Block partitioning information may also be predicted according topartitioning information from previously decoded blocks of a framedifferent than current frame. For example, the context/s to be used forarithmetic decoding block partitioning information (which includes splitinformation) for the current block, or the current block's splitinformation, can be predicted from a previously decoded block (e.g., acollocated block, the last decoded block or a decoded block identifiedby a motion vector) from a decoded frame which is different from currentframe.

At step S24003, partition selection parameters are parsed from abitstream. FIG. 37 shows the parsable locations of the partitionselection parameters in a compressed video bitstream.

Next, at step S24004, block partitioning information is selected onlyfrom the modified list of block partitioning information using theparsed partition selection parameters. Here, using the selected blockpartitioning information will result in partitioning a block into aplurality of sub blocks. The parsed partition selection parameters, forexample, can include an index to select one of the block partitioninginformation from the determined list of block partitioning information.The determined block partitioning information may be predetermined. Asanother example, the parsed partition selection parameters can include aplurality of split/merge flags to derive the block partitioninginformation from initial block partitioning information. Decoding bitsand the meaning of the partition selection parameters varies dependingon the selected block partitioning information. For example, when onlyhorizontal partition happens according to the selected blockpartitioning information, there is no need to indicate whether thepartition is a horizontal or vertical partition, and portioning a blocksimply means horizontally partitioning a block as shown in FIG. 53. Onthe other hand, when only vertical partition happens according to theselected block partitioning information, there is also no need toindicate whether the partition is a horizontal or vertical partition,and portioning a block simply means vertically partitioning a block.

At step S24005, a block is partitioned into a plurality of sub blocksusing the selected block partitioning information.

At step S24006, a sub block from the plurality of sub blocks is decodedin a decoding process. Here, the decoding process includes an inversetransform process and/or a prediction process. The inverse transformprocess may be performed on a per block basis similar to the sub blocksize.

[Decoder]

The structure of the video/image encoder according to this embodiment isthe same as illustrated in FIG. 36 described in Embodiment 1.Accordingly, duplicate depiction and description is omitted.

Embodiment 13

In the above embodiments, the geometries of the block and/or sub blocksis not particularly restricted, but the geometries of the block and/orsub blocks may be restricted. For example, block width and height forthe block and sub blocks may be limited to a power of 2 each. Inparticular, when a multiple partition including at least threeodd-numbered child nodes is used, block width and height for the subblocks may be limited to a power of 2 each. In such cases, blockpartitioning information indicating a block width and height for the subblock that is not a power of 2 is not used for block partition.

In other words, the encoder according to this embodiment encodes a blockof an image, and includes a processor and memory connected to theprocessor. Using the memory, the processor: partitions a block into aplurality of sub blocks; and encodes a sub block included in theplurality of sub blocks in an encoding process including a transformprocess and/or a prediction process. The block is partitioned using amultiple partition including at least three odd-numbered child nodes.Each of a width and a height of each of the plurality of sub blocks is apower of two.

This makes it possible to partition a block into a plurality of subblocks whose widths and heights are each a power of 2, even when theblock is partitioned using a multiple partition including at least threeodd-numbered child nodes. Accordingly, it is possible to obtain subblocks in sizes suitable for encoding, and improve compressionefficiency.

Moreover, the decoder according to this embodiment decodes a block of animage, and includes a processor and memory connected to the processor.Using the memory, the processor: partitions a block into a plurality ofsub blocks; and decodes a sub block included in the plurality of subblocks in a decoding process including an inverse transform processand/or a prediction process. The block is partitioned using a multiplepartition including at least three odd-numbered child nodes. Each of awidth and a height of each of the plurality of sub blocks is a power oftwo.

This makes it possible to partition a block into a plurality of subblocks whose widths and heights are each a power of 2, even when theblock is partitioned using a multiple partition including at least threeodd-numbered child nodes. Accordingly, it is possible to obtain subblocks in sizes suitable for decoding, and improve compressionefficiency.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program, computerreadable medium such as a CD-ROM, or any given combination thereof.

Implementations and Applications

As described in each of the above embodiments, each functional oroperational block can typically be realized as an MPU (micro processingunit) and memory, for example. Moreover, processes performed by each ofthe functional blocks may be realized as a program execution unit, suchas a processor which reads and executes software (a program) recorded ona recording medium such as ROM. The software may be distributed. Thesoftware may be recorded on a variety of recording media such assemiconductor memory. Note that each functional block can also berealized as hardware (dedicated circuit).

The processing described in each of the embodiments may be realized viaintegrated processing using a single apparatus (system), and,alternatively, may be realized via decentralized processing using aplurality of apparatuses. Moreover, the processor that executes theabove-described program may be a single processor or a plurality ofprocessors. In other words, integrated processing may be performed, and,alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the aboveexemplary embodiments; various modifications may be made to theexemplary embodiments, the results of which are also included within thescope of the embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (imageencoding method) and the moving picture decoding method (image decodingmethod) described in each of the above embodiments will be described, aswell as various systems that implement the application examples. Such asystem may be characterized as including an image encoder that employsthe image encoding method, an image decoder that employs the imagedecoding method, or an image encoder-decoder that includes both theimage encoder and the image decoder. Other configurations of such asystem may be modified on a case-by-case basis.

(Usage Examples) FIG. 54 illustrates an overall configuration of contentproviding system ex100 suitable for implementing a content distributionservice. The area in which the communication service is provided isdivided into cells of desired sizes, and base stations ex106, ex107,ex108, ex109, and ex110, which are fixed wireless stations in theillustrated example, are located in respective cells.

In content providing system ex100, devices including computer ex111,gaming device ex112, camera ex113, home appliance ex114, and smartphoneex115 are connected to internet ex101 via internet service providerex102 or communications network ex104 and base stations ex106 throughex110. Content providing system ex100 may combine and connect anycombination of the above devices. In various implementations, thedevices may be directly or indirectly connected together via a telephonenetwork or near field communication, rather than via base stations ex106through ex110. Further, streaming server ex103 may be connected todevices including computer ex111, gaming device ex112, camera ex113,home appliance ex114, and smartphone ex115 via, for example, internetex101. Streaming server ex103 may also be connected to, for example, aterminal in a hotspot in airplane ex117 via satellite ex116.

Note that instead of base stations ex106 through ex110, wireless accesspoints or hotspots may be used. Streaming server ex103 may be connectedto communications network ex104 directly instead of via internet ex101or internet service provider ex102, and may be connected to airplaneex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video,such as a digital camera. Smartphone ex115 is a smartphone device,cellular phone, or personal handyphone system (PHS) phone that canoperate under the mobile communications system standards of the 2G, 3G,3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex114 is, for example, a refrigerator or a deviceincluded in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/orvideo capturing function is capable of, for example, live streaming byconnecting to streaming server ex103 via, for example, base stationex106. When live streaming, a terminal (e.g., computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, orairplane ex117) may perform the encoding processing described in theabove embodiments on still-image or video content captured by a user viathe terminal, may multiplex video data obtained via the encoding andaudio data obtained by encoding audio corresponding to the video, andmay transmit the obtained data to streaming server ex103. In otherwords, the terminal functions as the image encoder according to oneaspect of the present disclosure.

Streaming server ex103 streams transmitted content data to clients thatrequest the stream. Client examples include computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, andterminals inside airplane ex117, which are capable of decoding theabove-described encoded data. Devices that receive the streamed datadecode and reproduce the received data. In other words, the devices mayeach function as the image decoder, according to one aspect of thepresent disclosure.

(Decentralized Processing)

Streaming server ex103 may be realized as a plurality of servers orcomputers between which tasks such as the processing, recording, andstreaming of data are divided. For example, streaming server ex103 maybe realized as a content delivery network (CDN) that streams content viaa network connecting multiple edge servers located throughout the world.In a CDN, an edge server physically near the client is dynamicallyassigned to the client. Content is cached and streamed to the edgeserver to reduce load times. In the event of, for example, some type oferror or change in connectivity due, for example, to a spike in traffic,it is possible to stream data stably at high speeds, since it ispossible to avoid affected parts of the network by, for example,dividing the processing between a plurality of edge servers, orswitching the streaming duties to a different edge server and continuingstreaming. Decentralization is not limited to just the division ofprocessing for streaming; the encoding of the captured data may bedivided between and performed by the terminals, on the server side, orboth. In one example, in typical encoding, the processing is performedin two loops. The first loop is for detecting how complicated the imageis on a frame-by-frame or scene-by-scene basis, or detecting theencoding load. The second loop is for processing that maintains imagequality and improves encoding efficiency. For example, it is possible toreduce the processing load of the terminals and improve the quality andencoding efficiency of the content by having the terminals perform thefirst loop of the encoding and having the server side that received thecontent perform the second loop of the encoding. In such a case, uponreceipt of a decoding request, it is possible for the encoded dataresulting from the first loop performed by one terminal to be receivedand reproduced on another terminal in approximately real time.

This makes it possible to realize smooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amountfrom an image, compresses data related to the feature amount asmetadata, and transmits the compressed metadata to a server. Forexample, the server determines the significance of an object based onthe feature amount and changes the quantization accuracy accordingly toperform compression suitable for the meaning (or content significance)of the image. Feature amount data is particularly effective in improvingthe precision and efficiency of motion vector prediction during thesecond compression pass performed by the server. Moreover, encoding thathas a relatively low processing load, such as variable length coding(VLC), may be handled by the terminal, and encoding that has arelatively high processing load, such as context-adaptive binaryarithmetic coding (CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality ofvideos of approximately the same scene are captured by a plurality ofterminals in, for example, a stadium, shopping mall, or factory. In sucha case, for example, the encoding may be decentralized by dividingprocessing tasks between the plurality of terminals that captured thevideos and, if necessary, other terminals that did not capture thevideos, and the server, on a per-unit basis. The units may be, forexample, groups of pictures (GOP), pictures, or tiles resulting fromdividing a picture. This makes it possible to reduce load times andachieve streaming that is closer to real time.

Since the videos are of approximately the same scene, management and/orinstructions may be carried out by the server so that the videoscaptured by the terminals can be cross-referenced. Moreover, the servermay receive encoded data from the terminals, change the referencerelationship between items of data, or correct or replace picturesthemselves, and then perform the encoding. This makes it possible togenerate a stream with increased quality and efficiency for theindividual items of data.

Furthermore, the server may stream video data after performingtranscoding to convert the encoding format of the video data. Forexample, the server may convert the encoding format from MPEG to VP(e.g., VP9), and may convert H.264 to H.265.

In this way, encoding can be performed by a terminal or one or moreservers. Accordingly, although the device that performs the encoding isreferred to as a “server” or “terminal” in the following description,some or all of the processes performed by the server may be performed bythe terminal, and likewise some or all of the processes performed by theterminal may be performed by the server. This also applies to decodingprocesses.

(3D, Multi-angle)

There has been an increase in usage of images or videos combined fromimages or videos of different scenes concurrently captured, or of thesame scene captured from different angles, by a plurality of terminalssuch as camera ex113 and/or smartphone ex115. Videos captured by theterminals are combined based on, for example, the separately obtainedrelative positional relationship between the terminals, or regions in avideo having matching feature points.

In addition to the encoding of two-dimensional moving pictures, theserver may encode a still image based on scene analysis of a movingpicture, either automatically or at a point in time specified by theuser, and transmit the encoded still image to a reception terminal.Furthermore, when the server can obtain the relative positionalrelationship between the video capturing terminals, in addition totwo-dimensional moving pictures, the server can generatethree-dimensional geometry of a scene based on video of the same scenecaptured from different angles. The server may separately encodethree-dimensional data generated from, for example, a point cloud and,based on a result of recognizing or tracking a person or object usingthree-dimensional data, may select or reconstruct and generate a videoto be transmitted to a reception terminal, from videos captured by aplurality of terminals.

This allows the user to enjoy a scene by freely selecting videoscorresponding to the video capturing terminals, and allows the user toenjoy the content obtained by extracting a video at a selected viewpointfrom three-dimensional data reconstructed from a plurality of images orvideos. Furthermore, as with video, sound may be recorded fromrelatively different angles, and the server may multiplex audio from aspecific angle or space with the corresponding video, and transmit themultiplexed video and audio.

In recent years, content that is a composite of the real world and avirtual world, such as virtual reality (VR) and augmented reality (AR)content, has also become popular. In the case of VR images, the servermay create images from the viewpoints of both the left and right eyes,and perform encoding that tolerates reference between the two viewpointimages, such as multi-view coding (MVC), and, alternatively, may encodethe images as separate streams without referencing. When the images aredecoded as separate streams, the streams may be synchronized whenreproduced, so as to recreate a virtual three-dimensional space inaccordance with the viewpoint of the user.

In the case of AR images, the server superimposes virtual objectinformation existing in a virtual space onto camera informationrepresenting a real-world space, based on a three-dimensional positionor movement from the perspective of the user. The decoder may obtain orstore virtual object information and three-dimensional data, generatetwo-dimensional images based on movement from the perspective of theuser, and then generate superimposed data by seamlessly connecting theimages. Alternatively, the decoder may transmit, to the server, motionfrom the perspective of the user in addition to a request for virtualobject information. The server may generate superimposed data based onthree-dimensional data stored in the server in accordance with thereceived motion, and encode and stream the generated superimposed datato the decoder. Note that superimposed data includes, in addition to RGBvalues, an a value indicating transparency, and the server sets the avalue for sections other than the object generated fromthree-dimensional data to, for example, 0, and may perform the encodingwhile those sections are transparent. Alternatively, the server may setthe background to a determined RGB value, such as a chroma key, andgenerate data in which areas other than the object are set as thebackground. The determined RGB value may be predetermined. Decoding ofsimilarly streamed data may be performed by the client (i.e., theterminals), on the server side, or divided therebetween. In one example,one terminal may transmit a reception request to a server, the requestedcontent may be received and decoded by another terminal, and a decodedsignal may be transmitted to a device having a display. It is possibleto reproduce high image quality data by decentralizing processing andappropriately selecting content regardless of the processing ability ofthe communications terminal itself. In yet another example, while a TV,for example, is receiving image data that is large in size, a region ofa picture, such as a tile obtained by dividing the picture, may bedecoded and displayed on a personal terminal or terminals of a viewer orviewers of the TV. This makes it possible for the viewers to share abig-picture view as well as for each viewer to check his or her assignedarea, or inspect a region in further detail up close.

In situations in which a plurality of wireless connections are possibleover near, mid, and far distances, indoors or outdoors, it may bepossible to seamlessly receive content using a streaming system standardsuch as MPEG-DASH. The user may switch between data in real time whilefreely selecting a decoder or display apparatus including the user'sterminal, displays arranged indoors or outdoors, etc. Moreover, using,for example, information on the position of the user, decoding can beperformed while switching which terminal handles decoding and whichterminal handles the displaying of content. This makes it possible tomap and display information, while the user is on the move in route to adestination, on the wall of a nearby building in which a device capableof displaying content is embedded, or on part of the ground. Moreover,it is also possible to switch the bit rate of the received data based onthe accessibility to the encoded data on a network, such as when encodeddata is cached on a server quickly accessible from the receptionterminal, or when encoded data is copied to an edge server in a contentdelivery service.

(Scalable Encoding)

The switching of content will be described with reference to a scalablestream, illustrated in FIG. 55, which is compression coded viaimplementation of the moving picture encoding method described in theabove embodiments. The server may have a configuration in which contentis switched while making use of the temporal and/or spatial scalabilityof a stream, which is achieved by division into and encoding of layers,as illustrated in FIG. 55. Note that there may be a plurality ofindividual streams that are of the same content but different quality.In other words, by determining which layer to decode based on internalfactors, such as the processing ability on the decoder side, andexternal factors, such as communication bandwidth, the decoder side canfreely switch between low resolution content and high resolution contentwhile decoding. For example, in a case in which the user wants tocontinue watching, for example at home on a device such as a TVconnected to the internet, a video that the user had been previouslywatching on smartphone ex115 while on the move, the device can simplydecode the same stream up to a different layer, which reduces the serverside load.

Furthermore, in addition to the configuration described above, in whichscalability is achieved as a result of the pictures being encoded perlayer, with the enhancement layer being above the base layer, theenhancement layer may include metadata based on, for example,statistical information on the image. The decoder side may generate highimage quality content by performing super-resolution imaging on apicture in the base layer based on the metadata. Super-resolutionimaging may improve the SN ratio while maintaining resolution and/orincreasing resolution. Metadata includes information for identifying alinear or a non-linear filter coefficient, as used in super-resolutionprocessing, or information identifying a parameter value in filterprocessing, machine learning, or a least squares method used insuper-resolution processing.

Alternatively, a configuration may be provided in which a picture isdivided into, for example, tiles in accordance with, for example, themeaning of an object in the image. On the decoder side, only a partialregion is decoded by selecting a tile to decode. Further, by storing anattribute of the object (person, car, ball, etc.) and a position of theobject in the video (coordinates in identical images) as metadata, thedecoder side can identify the position of a desired object based on themetadata and determine which tile or tiles include that object. Forexample, as illustrated in FIG. 56, metadata may be stored using a datastorage structure different from pixel data, such as an SEI(supplemental enhancement information) message in HEVC. This metadataindicates, for example, the position, size, or color of the main object.

Metadata may be stored in units of a plurality of pictures, such asstream, sequence, or random access units. The decoder side can obtain,for example, the time at which a specific person appears in the video,and by fitting the time information with picture unit information, canidentify a picture in which the object is present, and can determine theposition of the object in the picture.

(Web Page Optimization)

FIG. 57 illustrates an example of a display screen of a web page oncomputer ex111, for example. FIG. 58 illustrates an example of a displayscreen of a web page on smartphone ex115, for example. As illustrated inFIG. 57 and FIG. 58, a web page may include a plurality of image linksthat are links to image content, and the appearance of the web pagediffers depending on the device used to view the web page. When aplurality of image links are viewable on the screen, until the userexplicitly selects an image link, or until the image link is in theapproximate center of the screen or the entire image link fits in thescreen, the display apparatus (decoder) may display, as the image links,still images included in the content or I pictures; may display videosuch as an animated gif using a plurality of still images or I pictures;or may receive only the base layer, and decode and display the video.

When an image link is selected by the user, the display apparatusperforms decoding while giving the highest priority to the base layer.Note that if there is information in the HTML code of the web pageindicating that the content is scalable, the display apparatus maydecode up to the enhancement layer. Further, in order to guaranteereal-time reproduction, before a selection is made or when the bandwidthis severely limited, the display apparatus can reduce delay between thepoint in time at which the leading picture is decoded and the point intime at which the decoded picture is displayed (that is, the delaybetween the start of the decoding of the content to the displaying ofthe content) by decoding and displaying only forward reference pictures(I picture, P picture, forward reference B picture). Still further, thedisplay apparatus may purposely ignore the reference relationshipbetween pictures, and coarsely decode all B and P pictures as forwardreference pictures, and then perform normal decoding as the number ofpictures received over time increases.

(Autonomous Driving)

When transmitting and receiving still image or video data such as two-or three-dimensional map information for autonomous driving or assisteddriving of an automobile, the reception terminal may receive, inaddition to image data belonging to one or more layers, information on,for example, the weather or road construction as metadata, and associatethe metadata with the image data upon decoding. Note that metadata maybe assigned per layer and, alternatively, may simply be multiplexed withthe image data.

In such a case, since the automobile, drone, airplane, etc., containingthe reception terminal is mobile, the reception terminal can seamlesslyreceive and perform decoding while switching between base stations amongbase stations ex106 through ex110 by transmitting information indicatingthe position of the reception terminal. Moreover, in accordance with theselection made by the user, the situation of the user, and/or thebandwidth of the connection, the reception terminal can dynamicallyselect to what extent the metadata is received, or to what extent themap information, for example, is updated.

In content providing system ex100, the client can receive, decode, andreproduce, in real time, encoded information transmitted by the user.

(Streaming of Individual Content)

In content providing system ex100, in addition to high image quality,long content distributed by a video distribution entity, unicast ormulticast streaming of low image quality, and short content from anindividual are also possible. Such content from individuals is likely tofurther increase in popularity. The server may first perform editingprocessing on the content before the encoding processing, in order torefine the individual content. This may be achieved using the followingconfiguration, for example.

In real time while capturing video or image content, or after thecontent has been captured and accumulated, the server performsrecognition processing based on the raw data or encoded data, such ascapture error processing, scene search processing, meaning analysis,and/or object detection processing. Then, based on the result of therecognition processing, the server—either when prompted orautomatically—edits the content, examples of which include: correctionsuch as focus and/or motion blur correction; removing low-priorityscenes such as scenes that are low in brightness compared to otherpictures, or out of focus; object edge adjustment; and color toneadjustment. The server encodes the edited data based on the result ofthe editing. It is known that excessively long videos tend to receivefewer views. Accordingly, in order to keep the content within a specificlength that scales with the length of the original video, the servermay, in addition to the low-priority scenes described above,automatically clip out scenes with low movement, based on an imageprocessing result. Alternatively, the server may generate and encode avideo digest based on a result of an analysis of the meaning of a scene.

There may be instances in which individual content may include contentthat infringes a copyright, moral right, portrait rights, etc. Suchinstance may lead to an unfavorable situation for the creator, such aswhen content is shared beyond the scope intended by the creator.Accordingly, before encoding, the server may, for example, edit imagesso as to blur faces of people in the periphery of the screen or blur theinside of a house, for example. Further, the server may be configured torecognize the faces of people other than a registered person in imagesto be encoded, and when such faces appear in an image, may apply amosaic filter, for example, to the face of the person. Alternatively, aspre- or post-processing for encoding, the user may specify, forcopyright reasons, a region of an image including a person or a regionof the background to be processed. The server may process the specifiedregion by, for example, replacing the region with a different image, orblurring the region. If the region includes a person, the person may betracked in the moving picture, and the person's head region may bereplaced with another image as the person moves.

Since there is a demand for real-time viewing of content produced byindividuals, which tends to be small in data size, the decoder firstreceives the base layer as the highest priority, and performs decodingand reproduction, although this may differ depending on bandwidth. Whenthe content is reproduced two or more times, such as when the decoderreceives the enhancement layer during decoding and reproduction of thebase layer, and loops the reproduction, the decoder may reproduce a highimage quality video including the enhancement layer. If the stream isencoded using such scalable encoding, the video may be low quality whenin an unselected state or at the start of the video, but it can offer anexperience in which the image quality of the stream progressivelyincreases in an intelligent manner. This is not limited to just scalableencoding; the same experience can be offered by configuring a singlestream from a low quality stream reproduced for the first time and asecond stream encoded using the first stream as a reference.

(Other Implementation and Application Examples)

The encoding and decoding may be performed by LSI (large scaleintegration circuitry) ex500 (see FIG. 54), which is typically includedin each terminal. LSI ex500 may be configured of a single chip or aplurality of chips. Software for encoding and decoding moving picturesmay be integrated into some type of a recording medium (such as aCD-ROM, a flexible disk, or a hard disk) that is readable by, forexample, computer ex111, and the encoding and decoding may be performedusing the software. Furthermore, when smartphone ex115 is equipped witha camera, the video data obtained by the camera may be transmitted. Inthis case, the video data is coded by LSI ex500 included in smartphoneex115.

Note that LSI ex500 may be configured to download and activate anapplication. In such a case, the terminal first determines whether it iscompatible with the scheme used to encode the content, or whether it iscapable of executing a specific service. When the terminal is notcompatible with the encoding scheme of the content, or when the terminalis not capable of executing a specific service, the terminal firstdownloads a codec or application software and then obtains andreproduces the content. Aside from the example of content providingsystem ex100 that uses internet ex101, at least the moving pictureencoder (image encoder) or the moving picture decoder (image decoder)described in the above embodiments may be implemented in a digitalbroadcasting system. The same encoding processing and decodingprocessing may be applied to transmit and receive broadcast radio wavessuperimposed with multiplexed audio and video data using, for example, asatellite, even though this is geared toward multicast, whereas unicastis easier with content providing system ex100.

(Hardware Configuration)

FIG. 59 illustrates further details of smartphone ex115 shown in FIG.54. FIG. 60 illustrates a configuration example of smartphone ex115.Smartphone ex115 includes antenna ex450 for transmitting and receivingradio waves to and from base station ex110, camera ex465 capable ofcapturing video and still images, and display ex458 that displaysdecoded data, such as video captured by camera ex465 and video receivedby antenna ex450. Smartphone ex115 includes user interface ex466 such asa touch panel, audio output unit ex457 such as a speaker for outputtingspeech or other audio, audio input unit ex456 such as a microphone foraudio input, memory ex467 capable of storing decoded data such ascaptured video or still images, recorded audio, received video or stillimages, and mail, as well as decoded data, and slot ex464 which is aninterface for SIM ex468 for authorizing access to a network and variousdata. Note that external memory may be used instead of memory ex467.

Main controller ex460, which comprehensively controls display ex458 anduser interface ex466, power supply circuit ex461, user interface inputcontroller ex462, video signal processor ex455, camera interface ex463,display controller ex459, modulator/demodulator ex452,multiplexer/demultiplexer ex453, audio signal processor ex454, slotex464, and memory ex467 are connected via bus ex470.

When the user turns on the power button of power supply circuit ex461,smartphone ex115 is powered on into an operable state, and eachcomponent is supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and datatransmission, based on control performed by main controller ex460, whichincludes a CPU, ROM, and RAM. When making calls, an audio signalrecorded by audio input unit ex456 is converted into a digital audiosignal by audio signal processor ex454, to which spread spectrumprocessing is applied by modulator/demodulator ex452 and digital-analogconversion, and frequency conversion processing is applied bytransmitter/receiver ex451, and the resulting signal is transmitted viaantenna ex450. The received data is amplified, frequency converted, andanalog-digital converted, inverse spread spectrum processed bymodulator/demodulator ex452, converted into an analog audio signal byaudio signal processor ex454, and then output from audio output unitex457. In data transmission mode, text, still-image, or video data istransmitted by main controller ex460 via user interface input controllerex462 based on operation of user interface ex466 of the main body, forexample. Similar transmission and reception processing is performed. Indata transmission mode, when sending a video, still image, or video andaudio, video signal processor ex455 compression encodes, via the movingpicture encoding method described in the above embodiments, a videosignal stored in memory ex467 or a video signal input from camera ex465,and transmits the encoded video data to multiplexer/demultiplexer ex453.Audio signal processor ex454 encodes an audio signal recorded by audioinput unit ex456 while camera ex465 is capturing a video or still image,and transmits the encoded audio data to multiplexer/demultiplexer ex453.Multiplexer/demultiplexer ex453 multiplexes the encoded video data andencoded audio data using a determined scheme, modulates and converts thedata using modulator/demodulator (modulator/demodulator circuit) ex452and transmitter/receiver ex451, and transmits the result via antennaex450. The determined scheme may be predetermined.

When video appended in an email or a chat, or a video linked from a webpage, is received, for example, in order to decode the multiplexed datareceived via antenna ex450, multiplexer/demultiplexer ex453demultiplexes the multiplexed data to divide the multiplexed data into abitstream of video data and a bitstream of audio data, supplies theencoded video data to video signal processor ex455 via synchronous busex470, and supplies the encoded audio data to audio signal processorex454 via synchronous bus ex470. Video signal processor ex455 decodesthe video signal using a moving picture decoding method corresponding tothe moving picture encoding method described in the above embodiments,and video or a still image included in the linked moving picture file isdisplayed on display ex458 via display controller ex459. Audio signalprocessor ex454 decodes the audio signal and outputs audio from audiooutput unit ex457. Since real-time streaming is becoming increasinglypopular, there may be instances in which reproduction of the audio maybe socially inappropriate, depending on the user's environment.Accordingly, as an initial value, a configuration in which only videodata is reproduced, i.e., the audio signal is not reproduced, ispreferable; audio may be synchronized and reproduced only when an input,such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, three otherimplementations are conceivable: a transceiver terminal including bothan encoder and a decoder; a transmitter terminal including only anencoder; and a receiver terminal including only a decoder. In thedescription of the digital broadcasting system, an example is given inwhich multiplexed data obtained as a result of video data beingmultiplexed with audio data is received or transmitted. The multiplexeddata, however, may be video data multiplexed with data other than audiodata, such as text data related to the video. Further, the video dataitself rather than multiplexed data may be received or transmitted.

Although main controller ex460 including a CPU is described ascontrolling the encoding or decoding processes, various terminals ofteninclude GPUs. Accordingly, a configuration is acceptable in which alarge area is processed at once by making use of the performance abilityof the GPU via memory shared by the CPU and GPU, or memory including anaddress that is managed so as to allow common usage by the CPU and GPU.This makes it possible to shorten encoding time, maintain the real-timenature of the stream, and reduce delay. In particular, processingrelating to motion estimation, deblocking filtering, sample adaptiveoffset (SAO), and transformation/quantization can be effectively carriedout by the GPU instead of the CPU in units of pictures, for example, allat once.

1. An encoder that encodes a block of an image, the encoder comprising:a processor; and memory connected to the processor, wherein, using thememory, the processor: partitions a block into a plurality of subblocks; and encodes a sub block included in the plurality of sub blocksin an encoding process including at least a transform process or aprediction process, wherein the block is partitioned using a multiplepartition including at least three odd-numbered child nodes, and each ofa width and a height of each of the plurality of sub blocks is a powerof two.
 2. A decoder that decodes a block of an image, the decodercomprising: a processor; and memory connected to the processor, wherein,using the memory, the processor: partitions a block into a plurality ofsub blocks; and decodes a sub block included in the plurality of subblocks in a decoding process including at least an inverse transformprocess or a prediction process, wherein the block is partitioned usinga multiple partition including at least three odd-numbered child nodes,and each of a width and a height of each of the plurality of sub blocksis a power of two.
 3. An encoding method of encoding a block of animage, the encoding method comprising: partitioning a block into aplurality of sub blocks; and encoding a sub block included in theplurality of sub blocks in an encoding process including at least atransform process or a prediction process, wherein the block ispartitioned using a multiple partition including at least threeodd-numbered child nodes, and each of a width and a height of each ofthe plurality of sub blocks is a power of two.
 4. A decoding method ofdecoding a block of an image, the decoding method comprising:partitioning a block into a plurality of sub blocks; and decoding a subblock included in the plurality of sub blocks in a decoding processincluding at least an inverse transform process or a prediction process,wherein the block is partitioned using a multiple partition including atleast three odd-numbered child nodes, and each of a width and a heightof each of the plurality of sub blocks is a power of two.